20 ideas
17962 | The truth-maker principle is that every truth has a sufficient truth-maker [Forrest] |
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] |
14187 | If logic is topic-neutral that means it delves into all subjects, rather than having a pure subject matter [Read] |
14188 | Not all arguments are valid because of form; validity is just true premises and false conclusion being impossible [Read] |
14182 | If the logic of 'taller of' rests just on meaning, then logic may be the study of merely formal consequence [Read] |
14183 | Maybe arguments are only valid when suppressed premises are all stated - but why? [Read] |
14184 | In modus ponens the 'if-then' premise contributes nothing if the conclusion follows anyway [Read] |
14186 | Logical connectives contain no information, but just record combination relations between facts [Read] |
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] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
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] |
14185 | Conditionals are just a shorthand for some proof, leaving out the details [Read] |