induction argument
21Enumerative induction — In logic, an enumerative induction is an argument of the type simple inductive schema. References …
22Existence of God — Part of a series on God General conceptions …
23König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …
24Chainstore paradox — (or Chain Store paradox ) is a concept that purports to refute standard game theory reasoning. Contents 1 The chain store game 1.1 Induction theory 1.2 Deterrence theory 1.3 …
25Finitary relation — This article sets out the set theoretic notion of relation. For a more elementary point of view, see Binary relation. For a combinatorial viewpoint, see Theory of relations. For other uses, see Relation (disambiguation). In set theory and logic,… …
26Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… …
27Parity of zero — Zero objects, divided into two equal groups Zero is an even number. In other words, its parity the quality of an integer being even or odd is even. Zero fits the definition of even number : it is an integer multiple of 2, namely 0 × 2. As a… …
28Directed set — In mathematics, a directed set (or a directed preorder or a filtered set) is a nonempty set A together with a reflexive and transitive binary relation ≤ (that is, a preorder), with the additional property that every pair of elements has an upper… …
29Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… …
30Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …
