Combining Texts

All the ideas for 'Induction', 'Negation' and 'Set Theory'

expand these ideas     |    start again     |     specify just one area for these texts


26 ideas

2. Reason / A. Nature of Reason / 9. Limits of Reason
Inconsistency doesn't prevent us reasoning about some system [Mares]
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Intuitionist logic looks best as natural deduction [Mares]
Intuitionism as natural deduction has no rule for negation [Mares]
4. Formal Logic / E. Nonclassical Logics / 3. Many-Valued Logic
Three-valued logic is useful for a theory of presupposition [Mares]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / c. Axiom of Pairing II
Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / d. Axiom of Unions III
Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Choice: ∀A ∃R (R well-orders A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
Set Existence: ∃x (x = x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / o. Axiom of Constructibility V = L
Constructibility: V = L (all sets are constructible) [Kunen]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Material implication (and classical logic) considers nothing but truth values for implications [Mares]
In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares]
5. Theory of Logic / D. Assumptions for Logic / 1. Bivalence
Standard disjunction and negation force us to accept the principle of bivalence [Mares]
Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
The connectives are studied either through model theory or through proof theory [Mares]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
Many-valued logics lack a natural deduction system [Mares]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
Situation semantics for logics: not possible worlds, but information in situations [Mares]
5. Theory of Logic / K. Features of Logics / 2. Consistency
Consistency is semantic, but non-contradiction is syntactic [Mares]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / b. Intuitionism
For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares]
13. Knowledge Criteria / C. External Justification / 8. Social Justification
If you would deny a truth if you know the full evidence, then knowledge has social aspects [Harman, by Sosa]
19. Language / C. Assigning Meanings / 2. Semantics
In 'situation semantics' our main concepts are abstracted from situations [Mares]