13 ideas
9470 | Modal logic is not an extensional language [Parsons,C] |
Full Idea: Modal logic is not an extensional language. | |
From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.159 n8) | |
A reaction: [I record this for investigation. Possible worlds seem to contain objects] |
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. |
9469 | Substitutional existential quantifier may explain the existence of linguistic entities [Parsons,C] |
Full Idea: I argue (against Quine) that the existential quantifier substitutionally interpreted has a genuine claim to express a concept of existence, which may give the best account of linguistic abstract entities such as propositions, attributes, and classes. | |
From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
A reaction: Intuitively I have my doubts about this, since the whole thing sounds like a verbal and conventional game, rather than anything with a proper ontology. Ruth Marcus and Quine disagree over this one. |
9468 | On the substitutional interpretation, '(∃x) Fx' is true iff a closed term 't' makes Ft true [Parsons,C] |
Full Idea: For the substitutional interpretation of quantifiers, a sentence of the form '(∃x) Fx' is true iff there is some closed term 't' of the language such that 'Ft' is true. For the objectual interpretation some object x must exist such that Fx is true. | |
From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
A reaction: How could you decide if it was true for 't' if you didn't know what object 't' referred to? |
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) |
1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
Full Idea: Archelaus was the first person to say that the universe is boundless. | |
From: report of Archelaus (fragments/reports [c.450 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Ar.3 |
5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
Full Idea: Archelaus wrote that life on Earth began in a primeval slime. | |
From: report of Archelaus (fragments/reports [c.450 BCE]) by Malcolm Schofield - Archelaus | |
A reaction: This sounds like a fairly clearcut assertion of the production of life by evolution. Darwin's contribution was to propose the mechanism for achieving it. We should honour the name of Archelaus for this idea. |