display all the ideas for this combination of texts
8 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. |
| 4730 | For Aristotle, the subject-predicate structure of Greek reflected a substance-accident structure of reality [Aristotle, by O'Grady] |
| Full Idea: Aristotle apparently believed that the subject-predicate structure of Greek reflected the substance-accident nature of reality. | |
| From: report of Aristotle (works [c.330 BCE]) by Paul O'Grady - Relativism Ch.4 | |
| A reaction: We need not assume that Aristotle is wrong. It is a chicken-and-egg. There is something obvious about subject-predicate language, if one assumes that unified objects are part of nature, and not just conventional. |
| 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. |