Combining Philosophers

Ideas for Eucleides, Marcus Rossberg and Feferman / Feferman

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

display all the ideas for this combination of philosophers

17 ideas

5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
10751 Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg]
10757 Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg]
10759 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
10753 Logical consequence is intuitively semantic, and captured by model theory [Rossberg]
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
10752 Γ |- 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
10754 In proof-theory, logical form is shown by the logical constants [Rossberg]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10158 A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
10162 Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman]
10756 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
10758 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
10160 Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
10159 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
10161 If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman]
10761 Completeness can always be achieved by cunning model-design [Rossberg]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
10755 A deductive system is only incomplete with respect to a formal semantics [Rossberg]
5. Theory of Logic / K. Features of Logics / 7. Decidability
10156 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
10155 Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]