Combining Philosophers

Ideas for Melvin Fitting, Stephen P. Schwartz and Herbert B. Enderton

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

display all the ideas for this combination of philosophers

13 ideas

5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
9722 Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton]
5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
11026 Classical logic is deliberately extensional, in order to model mathematics [Fitting]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
9718 Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
5829 We refer to Thales successfully by name, even if all descriptions of him are false [Schwartz,SP]
5830 The traditional theory of names says some of the descriptions must be correct [Schwartz,SP]
5. Theory of Logic / F. Referring in Logic / 3. Property (λ-) Abstraction
11028 λ-abstraction disambiguates the scope of modal operators [Fitting]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
9721 A logical truth or tautology is a logical consequence of the empty set [Enderton]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
9994 A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton]
5. Theory of Logic / K. Features of Logics / 3. Soundness
9719 A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 4. Completeness
9720 A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 6. Compactness
9995 Proof in finite subsets is sufficient for proof in an infinite set [Enderton]
5. Theory of Logic / K. Features of Logics / 7. Decidability
9996 Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
9997 For a reasonable language, the set of valid wff's can always be enumerated [Enderton]