「axioms」の共起表現一覧(1語右で並び替え)

axioms

1語右で並び替え

該当件数:66件

  • a of mathematics defined by its assumptions or axioms, a proof is an argument establishing a theorem
  • The last pair present the gyrator axioms and the middle axiom links the two pairs.
  • heory of everything is expected to be based on axioms and to deduce all observable phenomena from th
  • choice of a large number of schemes of logical axioms and a small set of rules of inference.
  • e way they balance a trade-off between logical axioms and rules of inference.
  • e or massless) verify the Osterwalder-Schrader axioms, and hence the theory makes sense as a quantum
  • tions and their structure, as given by certain axioms and algebraic laws, that is, to the algebraic
  • The first pair of axioms are like the group axioms.
  • ranches of mathematics, the Kuratowski closure axioms are a set of axioms which can be used to defin
  • These axioms are equivalent to those of the abstract stack
  • far from being self-evident, most of his moral axioms are open to serious controversy.
  • y relation symbol, and includes no non-logical axioms at all (Monk 1976:240-242).
  • A list of large cardinal axioms by consistency strength is available here.
  • ry of the natural numbers expressed in Peano's axioms cannot be decided with such an algorithm, howe
  • luents, like the fluent calculus, but also has axioms constraining the value of fluents, like the su
  • eration and binary relation satisfying certain axioms detailed below.
  • These axioms do not place any constraints on the set of val
  • For example, one may replace the three axioms FALSE, NOT-1', and NOT-2' with the two axioms
  • If the axioms for contraposition are added, also ¬Man(Z) bec
  • Block, On the Mills-Seligman axioms for Lie algebras of classical type Trans.
  • Induction schema that is part of Peano's axioms for the arithmetic of the natural numbers;
  • For example Γ could be a set of axioms for group theory or set theory.
  • This process led to a set of six axioms forming the basis for a new mathematical theor
  • oach is the elegant semantics: a change in the axioms has a well-defined change in the algorithm.
  • The axioms I1, I2, and I3 were at first suspected to be i
  • Formal ethics has four axioms in addition to the axioms of predicate and mod
  • i, M. Magidor: The evolution of large cardinal axioms in set theory, in: Higher set theory (Proc.
  • There are many important axioms in set theory which assert the existence of a
  • eal of science as necessary demonstration from axioms known with certainty.
  • a system of theorems following logically from axioms known with certainty.
  • Neither Mally's original axioms nor a modification that avoids this result rem
  • essentially the strongest known large cardinal axioms not known to be inconsistent in ZFC; the axiom
  • "The completeness of the axioms of the functional calculus of logic," 582-91.
  • Aronszajn lines is provable using the standard axioms of set theory.
  • Solovay, W. N. Reinhardt, A. Kanamori: Strong axioms of infinity and elementary embeddings, Annals
  • The axioms of Web Architecture describes the basic buildi
  • cessible cardinal axiom is unprovable from the axioms of ZFC.
  • The axioms of ZFC along with the universe axiom (or equiv
  • nd is most known as the originator Armstrong's axioms of dependency in a Relational database.
  • on in S of the Pairing, Null set, and Infinity axioms of Z.
  • ntable sets can be proven to be a set from the axioms of Zermelo-Fraenkel set theory (ZF) without an
  • ther be proven nor disproven from the standard axioms of set theory.
  • n addition to nine other books -- notably, The Axioms of Religion, Why is Christianity True?, and Ch
  • h sets can also be proven to be a set from the axioms of ZF, and is designated .
  • linear, it has become necessary to augment the axioms of projective geometry with Fano's axiom that
  • ven as true - these could be, for example, the axioms of the theory we are working in, or earlier th
  • and the axiom of global choice (with the other axioms of Morse-Kelley set theory) imply this axiom,
  • inite undirected graphs, as it obeys the three axioms of partial orders: it is reflexive (every grap
  • ches to matroids, but two different systems of axioms often look very different.
  • athematics, two objects, especially systems of axioms or semantics for them, are called cryptomorphi
  • ∨) of intuitionistic logic, with no additional axioms or rules about ⊥.
  • ules (also called inference rules) or a set of axioms, or have both.
  • The axioms presented below comprise the full axiomatic sy
  • The Peano axioms state conditions that any successful definitio
  • symbol j to the language of ZFC, together with axioms stating that j is an elementary embedding of V
  • bout types, although some argue that Zermelo's axioms tacitly presuppose a background type theory.
  • The logic component expresses the axioms that may be used in the computation and the co
  • cher shows that the logical outcome of these 3 axioms together with the above noted assumption are t
  • His business axioms were simple.
  • It extends the syntax of ML to include axioms, which need not be executable but can rigorous