Combining Texts

All the ideas for 'Changes in Events and Changes in Things', 'Introduction to Mathematical Logic' and 'On Formally Undecidable Propositions'

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


39 ideas

3. Truth / F. Semantic Truth / 1. Tarski's Truth / a. Tarski's truth definition
Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine]
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
Post proved the consistency of propositional logic in 1921 [Walicki]
Propositional language can only relate statements as the same or as different [Walicki]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Boolean connectives are interpreted as functions on the set {1,0} [Walicki]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is useful for defining sets by properties, when the members are not yet known [Walicki]
The empty set avoids having to take special precautions in case members vanish [Walicki]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M]
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
Ordinals play the central role in set theory, providing the model of well-ordering [Walicki]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
To determine the patterns in logic, one must identify its 'building blocks' [Walicki]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner]
A compact axiomatisation makes it possible to understand a field as a whole [Walicki]
Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki]
5. Theory of Logic / K. Features of Logics / 2. Consistency
Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P]
5. Theory of Logic / K. Features of Logics / 3. Soundness
If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel]
The undecidable sentence can be decided at a 'higher' level in the system [Gödel]
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki]
Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki]
The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki]
Two infinite ordinals can represent a single infinite cardinal [Walicki]
Members of ordinals are ordinals, and also subsets of ordinals [Walicki]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
Inductive proof depends on the choice of the ordering [Walicki]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey]
First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P]
Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman]
Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna]
First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman]
Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman]
There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P]
'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro]
7. Existence / D. Theories of Reality / 8. Facts / b. Types of fact
That Queen Anne is dead is a 'general fact', not a fact about Queen Anne [Prior,AN]
10. Modality / A. Necessity / 2. Nature of Necessity
Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki]
17. Mind and Body / C. Functionalism / 2. Machine Functionalism
Basic logic can be done by syntax, with no semantics [Gödel, by Rey]
27. Natural Reality / D. Time / 2. Passage of Time / e. Tensed (A) series
'Thank goodness that's over' is not like 'thank goodness that happened on Friday' [Prior,AN]