display all the ideas for this combination of texts
9 ideas
8078 | Modus ponens is one of five inference rules identified by the Stoics [Chrysippus, by Devlin] |
Full Idea: Modus ponens is just one of the five different inference rules identified by the Stoics. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
A reaction: Modus ponens strikes me as being more like a definition of implication than a 'rule'. Implication is what gets you from one truth to another. All the implications of a truth must also be true. |
6023 | Every proposition is either true or false [Chrysippus, by Cicero] |
Full Idea: We hold fast to the position, defended by Chrysippus, that every proposition is either true or false. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by M. Tullius Cicero - On Fate ('De fato') 38 | |
A reaction: I am intrigued to know exactly how you defend this claim. It may depend what you mean by a proposition. A badly expressed proposition may have indeterminate truth, quite apart from the vague, the undecidable etc. |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
Full Idea: A structure is said to be a 'model' of an axiom system if each of its axioms is true in the structure (e.g. Euclidean or non-Euclidean geometry). 'Model theory' concerns which structures are models of a given language and axiom system. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
A reaction: This strikes me as the most interesting aspect of mathematical logic, since it concerns the ways in which syntactic proof-systems actually connect with reality. Tarski is the central theoretician here, and his theory of truth is the key. |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
Full Idea: In the late 1950s Tarski and Vaught defined and established basic properties of the relation of elementary equivalence between two structures, which holds when they make true exactly the same first-order sentences. This is fundamental to model theory. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
A reaction: This is isomorphism, which clarifies what a model is by giving identity conditions between two models. Note that it is 'first-order', and presumably founded on classical logic. |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
Full Idea: The Löwenheim-Skolem Theorem, the earliest in model theory, states that if a countable set of sentences in a first-order language has a model, then it has a countable model. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
A reaction: There are 'upward' (sentences-to-model) and 'downward' (model-to-sentences) versions of the theory. |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
Full Idea: Before Tarski's work in the 1930s, the main results in model theory were the Löwenheim-Skolem Theorem, and Gödel's establishment in 1929 of the completeness of the axioms and rules for the classical first-order predicate (or quantificational) calculus. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
Full Idea: Completeness is when, if a sentences holds in every model of a theory, then it is logically derivable from that theory. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
Full Idea: 'Recursion theory' is the subject of what can and cannot be solved by computing machines | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Ch.9) | |
A reaction: This because 'recursion' will grind out a result step-by-step, as long as the steps will 'halt' eventually. |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
Full Idea: In 1936 Church showed that Principia Mathematica is undecidable if it is ω-consistent, and a year later Rosser showed that Peano Arithmetic is undecidable, and any consistent extension of it. | |
From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int IV) |