「theorems」の共起表現一覧(1語右で並び替え)
該当件数 : 76件
Theorems A and B were used for the basis of the course | |
adrilateral and its three cases, proving many | theorems about its properties along the way. |
ite-state digital computers can prove certain | theorems about Godel-incomplete formal systems like Pe |
The Abella prover can be used to prove | theorems about λProlog programs and specifications. |
The first publication of theories and | theorems about learning in neural networks, secondary |
rovide an interactive environment for proving | theorems about the declarative core of λProlog. |
system of Euclidean geometry, with geometric | theorems adapted to serve as floor patterns for the da |
ause he resolutely concentrated on particular | theorems and conjectures throughout his illustrious ca |
e set of well-formed formulas is divided into | theorems and non-theorems. |
Art Gallery | Theorems and Algorithms (1987) ISBN 9780195039658 |
theory consisted of a collection of isolated | theorems and conjectures. |
Title of thesis: Fundamental | Theorems and Consequences of the Slip Theory of Plasti |
r started the interaction between fixed-point | theorems and automorphic forms. |
Tau proves both | theorems and arguments expressed in unrestricted first |
omated reasoning - mechanical verification of | theorems and other deductions in classical and non-cla |
The following basis | theorems apply to infinite, computably bounded, comput |
Both | theorems are often merged in the Bing-Nagata-Smirnov m |
The ML type system ensures that | theorems are derived using only the inference rules gi |
Logics whose | theorems are valid in every, including the empty, doma |
a popular book on mathematics, he categorized | theorems as beautiful theorems or ugly theorems. |
From the | theorems by Hirsch, it is one of the lowest dimensiona |
lidate a specification by proving “challenge” | theorems concerning properties that the specification |
rs in mathematical journals and two tracts on | theorems connected with the geometry of the triangle. |
t is a common tool to prove other metrization | theorems, e.g. the Moore metrization theorem: a collec |
id's Elements expound geometry as a system of | theorems following logically from axioms known with ce |
Some | Theorems for Partially Balanced Designs, W. S. Connor |
alakara has used the addition and subtraction | theorems for the sine and the cosine to give trigonome |
's theorem was among the earliest examples of | theorems found to be unprovable in Peano arithmetic bu |
niversity of Pennsylvania was I. Some Duality | Theorems II. |
alysis, where he proved most of the important | theorems in real analysis by constructive methods. |
Jon Folkman contributed important | theorems in many areas of combinatorics. |
Foundations of Constructive Analysis, proving | theorems in real analysis using constructive analysis. |
Theorems in the system are propositions of a special " | |
nequality which is useful for proving several | theorems in information theory. |
Logic Theorist soon proved 38 of the first 52 | theorems in chapter 2 of the Principia Mathematica. |
It would eventually prove 38 of the first 52 | theorems in Whitehead and Russell's Principia Mathemat |
e use of spinors, inspired by positive energy | theorems in the context of supergravity. |
There are also some | theorems in complex analysis which show the connection |
Two nice | theorems in this direction are Jaeger's 4-flow theorem |
ds allowed by formalists cannot prove all the | theorems in a sufficiently powerful system... |
Hence, as a consequence of the incompleteness | theorems, it is not possible to prove the relative con |
f, instead of trying to develop new proofs or | theorems itself. |
oined the term Tauberian to describe converse | theorems like that proved by Tauber. |
iophantine problems, especially to finiteness | theorems of the Faltings-Siegel type. |
completeness of the list was finished by the | theorems of Yevgraf Fyodorov and Arthur Schoenflies. |
is a model of L, as every L-MCS contains all | theorems of L. By Zorn's lemma, each L-consistent set |
Hilbert Space, and in particular, implies the | theorems of Jones and Okikiolu, where now the constant |
Given some basic | theorems of set theory, the proof is simple. |
as just one of several sciences, and held the | theorems of geometry on par with scientific facts. |
lication of his best known work, Some General | Theorems of Considerable use in the Higher Parts of Ma |
s Bayes' Theorem, one of the most fundamental | theorems of probability theory. |
was intended for beginners and which included | theorems on differential calculus and infinite series. |
He also studied and proved some | theorems on perfect powers, such as the Goldbach-Euler |
theorem as a countable infinite collection of | theorems, one for each formula φ. |
One of the | theorems proved by Ramsey in his 1930 paper On a probl |
hese functions are correctly implemented, all | theorems proven in the system must be valid. |
ained by the ramifications of the Fluctuation | Theorems, Pumping Quantization Theorems, and Pumping-R |
ew Casson and Gordon defined and proved basic | theorems regarding strongly irreducible Heegaard split |
If correct, these | theorems reinforce the specifier's understanding of th |
Many | theorems related to these cardinals have generalizatio |
Many of the Sobolev embedding | theorems require that the domain of study be a Lipschi |
(1990), Dilworth | Theorems: Selected Papers of Robert P. Dilworth, Conte |
ry implements an abstract data type of proven | theorems so that new objects of this type can only be |
na", rather than any one of the many specific | theorems that might help to articulate a given phenome |
a treatise entitled The Method of Mechanical | Theorems that had previously been thought lost. |
“From No-Go | Theorems to Supersymmetry Algebra”, Kar. |
We can apply the flux and these | theorems to many disciplines in which we see currents, |
Along with proving | theorems, Vampire has other related functionalities su |
s of the theory we are working in, or earlier | theorems we can build upon. |
The | theorems were stated without proof, but proofs for the |
uage, and a library of definitions and proved | theorems which can be referenced and used in new artic |
his issue is discussed in various prime ideal | theorems, which are necessary for many applications th |
rary (MML) consisting of many definitions and | theorems which can be referred to in newly written art |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |