12 ideas
| 10282 | 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. |
| 17807 | To study formal systems, look at the whole thing, and not just how it is constructed in steps [Curry] |
| Full Idea: In the study of formal systems we do not confine ourselves to the derivation of elementary propositions step by step. Rather we take the system, defined by its primitive frame, as datum, and then study it by any means at our command. | |
| From: Haskell B. Curry (Remarks on the definition and nature of mathematics [1954], 'The formalist') | |
| A reaction: This is what may potentially lead to an essentialist view of such things. Focusing on bricks gives formalism, focusing on buildings gives essentialism. |
| 10283 | 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) |
| 10284 | 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. |
| 10285 | 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). |
| 10288 | 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) |
| 10289 | 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) |
| 10287 | 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. |
| 10286 | 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) |
| 17806 | It is untenable that mathematics is general physical truths, because it needs infinity [Curry] |
| Full Idea: According to realism, mathematical propositions express the most general properties of our physical environment. This is the primitive view of mathematics, yet on account of the essential role played by infinity in mathematics, it is untenable today. | |
| From: Haskell B. Curry (Remarks on the definition and nature of mathematics [1954], 'The problem') | |
| A reaction: I resist this view, because Curry's view seems to imply a mad metaphysics. Hilbert resisted the role of the infinite in essential mathematics. If the physical world includes its possibilities, that might do the job. Hellman on structuralism? |
| 17808 | Saying mathematics is logic is merely replacing one undefined term by another [Curry] |
| Full Idea: To say that mathematics is logic is merely to replace one undefined term by another. | |
| From: Haskell B. Curry (Remarks on the definition and nature of mathematics [1954], 'Mathematics') |
| 18671 | The ground for an attitude is not a thing's 'goodness', but its concrete characteristics [Ewing] |
| Full Idea: The ground for an attitude lies not in some other ethical concept, goodness, but in the concrete, factual characteristics of what we pronounce good. ...We shall not be better off if we interpolate an indefinable characteristic of goodness besides. | |
| From: A.C. Ewing (The Definition of Good [1948], p.172), quoted by Francesco Orsi - Value Theory 1.4 | |
| A reaction: This is a forerunner of Scanlon's Buck-Passing theory of the source of value (in other properties). I approve of this approach. If I say 'actually this very strong cheese is really good', I'm not adding goodness to the cheese. |