Combining Texts

All the ideas for 'The Logic of Boundaryless Concepts', 'First-Order Logic' and 'Geometrical Method and Metaphysics'

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


11 ideas

5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W]
     Full Idea: A logic is a collection of closely related artificial languages, and its older meaning is the study of the rules of sound argument. The languages can be used as a framework for studying rules of argument.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.1)
     A reaction: [Hodges then says he will stick to the languages] The suspicion is that one might confine the subject to the artificial languages simply because it is easier, and avoids the tricky philosophical questions. That approximates to computer programming.
5. Theory of Logic / A. Overview of Logic / 3. Value of Logic
Logic guides thinking, but it isn't a substitute for it [Rumfitt]
     Full Idea: Logic is part of a normative theory of thinking, not a substitute for thinking.
     From: Ian Rumfitt (The Logic of Boundaryless Concepts [2007], p.13)
     A reaction: There is some sort of logicians' dream, going back to Leibniz, of a reasoning engine, which accepts propositions and outputs inferences. I agree with this idea. People who excel at logic are often, it seems to me, modest at philosophy.
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W]
     Full Idea: To have a truth-value, a first-order formula needs an 'interpretation' (I) of its constants, and a 'valuation' (ν) of its variables. Something in the world is attached to the constants; objects are attached to variables.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
There are three different standard presentations of semantics [Hodges,W]
     Full Idea: Semantic rules can be presented in 'Tarski style', where the interpretation-plus-valuation is reduced to the same question for simpler formulas, or the 'Henkin-Hintikka style' in terms of games, or the 'Barwise-Etchemendy style' for computers.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
     A reaction: I haven't yet got the hang of the latter two, but I note them to map the territory.
I |= φ means that the formula φ is true in the interpretation I [Hodges,W]
     Full Idea: I |= φ means that the formula φ is true in the interpretation I.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.5)
     A reaction: [There should be no space between the vertical and the two horizontals!] This contrasts with |-, which means 'is proved in'. That is a syntactic or proof-theoretic symbol, whereas |= is a semantic symbol (involving truth).
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W]
     Full Idea: Downward Löwenheim-Skolem (the weakest form): If L is a first-order language with at most countably many formulas, and T is a consistent theory in L. Then T has a model with at most countably many elements.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W]
     Full Idea: Upward Löwenheim-Skolem: every first-order theory with infinite models has arbitrarily large models.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
5. Theory of Logic / K. Features of Logics / 6. Compactness
If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W]
     Full Idea: Compactness Theorem: suppose T is a first-order theory, ψ is a first-order sentence, and T entails ψ. Then there is a finite subset U of T such that U entails ψ.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
     A reaction: If entailment is possible, it can be done finitely.
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
A 'set' is a mathematically well-behaved class [Hodges,W]
     Full Idea: A 'set' is a mathematically well-behaved class.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.6)
9. Objects / B. Unity of Objects / 3. Unity Problems / e. Vague objects
Vague membership of sets is possible if the set is defined by its concept, not its members [Rumfitt]
     Full Idea: Vagueness in respect of membership is consistency with determinacy of the set's identity, so long as a set's identity is taken to consist, not in its having such-and-such members, but in its being the extension of a concept.
     From: Ian Rumfitt (The Logic of Boundaryless Concepts [2007], p.5)
     A reaction: I find this view of sets much more appealing than the one that identifies a set with its members. The empty set is less of a problem, as well as non-existents. Logicians prefer the extensional view because it is tidy.
14. Science / D. Explanation / 2. Types of Explanation / g. Causal explanations
Minds are best explained by their ends, and bodies by efficient causes [Leibniz]
     Full Idea: Whatever concerns reasonable substances (the minds of men) is more naturally explained by the consideration of ends, whereas other substances (bodies) are better explained by efficient causes.
     From: Gottfried Leibniz (Geometrical Method and Metaphysics [1712], p.89)
     A reaction: That is, I take it, that the type of causal explanation considered most appropriate is the one that leads to the greatest understanding. So there is no absolute or correct answer as to which type of causation is the more important.