29 ideas
18781 | Inconsistency doesn't prevent us reasoning about some system [Mares] |
18789 | Intuitionist logic looks best as natural deduction [Mares] |
18790 | Intuitionism as natural deduction has no rule for negation [Mares] |
18787 | Three-valued logic is useful for a theory of presupposition [Mares] |
10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
18793 | Material implication (and classical logic) considers nothing but truth values for implications [Mares] |
18784 | In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares] |
18786 | Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares] |
18780 | Standard disjunction and negation force us to accept the principle of bivalence [Mares] |
18782 | The connectives are studied either through model theory or through proof theory [Mares] |
18783 | Many-valued logics lack a natural deduction system [Mares] |
18792 | Situation semantics for logics: not possible worlds, but information in situations [Mares] |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
18788 | For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares] |
18791 | In 'situation semantics' our main concepts are abstracted from situations [Mares] |
17371 | Some kinds are very explanatory, but others less so, and some not at all [Devitt] |
17372 | The higher categories are not natural kinds, so the Linnaean hierarchy should be given up [Devitt] |
17373 | Species pluralism says there are several good accounts of what a species is [Devitt] |