Combining Philosophers

All the ideas for Eucleides, Marcus Rossberg and Feferman / Feferman

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


24 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 / 7. Second-Order Logic
Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg]
Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg]
There are at least seven possible systems of semantics for second-order logic [Rossberg]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Logical consequence is intuitively semantic, and captured by model theory [Rossberg]
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
In proof-theory, logical form is shown by the logical constants [Rossberg]
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]
A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg]
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]
Completeness can always be achieved by cunning model-design [Rossberg]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
A deductive system is only incomplete with respect to a formal semantics [Rossberg]
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]
19. Language / B. Reference / 1. Reference theories
The Electra: she knows this man, but not that he is her brother [Eucleides, by Diog. Laertius]
22. Metaethics / C. The Good / 1. Goodness / b. Types of good
The chief good is unity, sometimes seen as prudence, or God, or intellect [Eucleides]