Combining Texts

All the ideas for 'The Value of Science', 'Alfred Tarski: life and logic' and 'Gentzen's Analysis of First-Order Proofs'

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


16 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman]
Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman]
Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman]
The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman]
Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is based on transitions between sentences [Prawitz]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
Natural deduction introduction rules may represent 'definitions' of logical connectives [Prawitz]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
In natural deduction, inferences are atomic steps involving just one logical constant [Prawitz]
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 says if the sentences are countable, so is the model [Feferman/Feferman]
Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [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]
26. Natural Theory / D. Laws of Nature / 11. Against Laws of Nature
The aim of science is just to create a comprehensive, elegant language to describe brute facts [Poincaré, by Harré]