Combining Texts

Ideas for 'Logical Pluralism', 'That Politics may be reduced to a Science' and 'Alfred Tarski: life and logic'

expand these ideas     |    start again     |     choose another area for these texts

display all the ideas for this combination of texts


16 ideas

5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic studies consequence; logical truths are consequences of everything, or nothing [Beall/Restall]
Syllogisms are only logic when they use variables, and not concrete terms [Beall/Restall]
5. Theory of Logic / A. Overview of Logic / 2. History of Logic
The view of logic as knowing a body of truths looks out-of-date [Beall/Restall]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
Logic studies arguments, not formal languages; this involves interpretations [Beall/Restall]
5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
The model theory of classical predicate logic is mathematics [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
There are several different consequence relations [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
A sentence follows from others if they always model it [Beall/Restall]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logical truth is much more important if mathematics rests on it, as logicism claims [Beall/Restall]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 4. Completeness
If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 7. Decidability
'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / d. The Preface paradox
Preface Paradox affirms and denies the conjunction of propositions in the book [Beall/Restall]