| 11033 | Predications of predicates are predications of their subjects [Aristotle] |
| Full Idea: Whenever one thing is predicated of another as of a subject, all things said of what is predicated will be said of the subject also. | |
| From: Aristotle (Categories [c.331 BCE], 01b10) |
| 9188 | Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett] |
| Full Idea: Gödel proved the completeness of standard formalizations of first-order logic, including Frege's original one. However, an implication of his famous theorem on the incompleteness of arithmetic is that second-order logic is incomplete. | |
| From: report of Kurt Gödel (works [1930]) by Michael Dummett - The Philosophy of Mathematics 3.1 | |
| A reaction: This must mean that it is impossible to characterise arithmetic fully in terms of first-order logic. In which case we can only characterize the features of abstract reality in general if we employ an incomplete system. We're doomed. |
| 8789 | Various strategies try to deal with the ontological commitments of second-order logic [Hale/Wright on Quine] |
| Full Idea: Quine said higher-order logic is 'set theory in sheep's clothing', and there is concern about the ontology that is involved. One approach is to deny quantificational ontological commitments, or say that the entities involved are first-order objects. | |
| From: comment on Willard Quine (Existence and Quantification [1966]) by B Hale / C Wright - Logicism in the 21st Century 8 | |
| A reaction: [compressed] The second strategy is from Boolos. This question seems to be right at the heart of the strategy of exploring our ontology through the study of our logic. |
| 10014 | Quine rejects second-order logic, saying that predicates refer to multiple objects [Quine, by Hodes] |
| Full Idea: Quine is unwilling to suppose second-order logic intelligible. He holds to Mill's account of the referential role of a predicate: it multiply denotes any and all objects to which it applies, and there is no need for a further 'predicative' entity. | |
| From: report of Willard Quine (Philosophy of Logic [1970]) by Harold Hodes - Logicism and Ontological Commits. of Arithmetic p.130 | |
| A reaction: If we assume that 'quantifying over' something is a commitment to its existence, then I think I am with Quine, because you end up with a massive commitment to universals, which I prefer to avoid. |
| 10828 | Quantifying over predicates is treating them as names of entities [Quine] |
| Full Idea: To put the predicate letter 'F' in a quantifier is to treat predicate position suddenly as name position, and hence to treat predicates as names of entities of some sort. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.5) | |
| A reaction: It is tricky to distinguish quantifying over predicates in a first-order way (by reifying them), and in a second-order way (where it is not clear whether you are quantifying over a property or a unified set of things. |
| 13639 | Quine says higher-order items are intensional, and lack a clearly defined identity relation [Quine, by Shapiro] |
| Full Idea: Quine (in 1941) attacked 'Principia Mathematica' because the items in the range of higher-order variables (attributes etc) are intensional and thus do not have a clearly defined identity relation. | |
| From: report of Willard Quine (Whitehead and the Rise of Modern Logic [1941]) by Stewart Shapiro - Foundations without Foundationalism 1.3 |
| 10794 | The nominalist is tied by standard semantics to first-order, denying higher-order abstracta [Marcus (Barcan)] |
| Full Idea: The nominalist finds that standard semantics shackles him to first-order languages if, as nominalists are wont, he is to make do without abstract higher order objects. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.166) | |
| A reaction: Aha! Since I am pursuing a generally nominalist strategy in metaphysics, I suddenly see that I must adopt a hostile attitude to higher-order logic! Maybe plural quantification is the way to go, with just first-order objects. |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| Full Idea: The expressive power of second-order logic is too great to admit a proof procedure, but is adequate to express set-theoretical statements, and open questions such as the continuum hypothesis or the existence of big cardinals are easily stated. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| Full Idea: Second-order logic has no chance of a completeness theorem unless one ventures into intensional entities and possible worlds. | |
| From: Ian Hacking (What is Logic? [1979], §13) |
| 14249 | Boolos reinterprets second-order logic as plural logic [Boolos, by Oliver/Smiley] |
| Full Idea: Boolos's conception of plural logic is as a reinterpretation of second-order logic. | |
| From: report of George Boolos (On Second-Order Logic [1975]) by Oliver,A/Smiley,T - What are Sets and What are they For? n5 | |
| A reaction: Oliver and Smiley don't accept this view, and champion plural reference differently (as, I think, some kind of metalinguistic device?). |
| 10830 | Second-order logic metatheory is set-theoretic, and second-order validity has set-theoretic problems [Boolos] |
| Full Idea: The metatheory of second-order logic is hopelessly set-theoretic, and the notion of second-order validity possesses many if not all of the epistemic debilities of the notion of set-theoretic truth. | |
| From: George Boolos (On Second-Order Logic [1975], p.45) | |
| A reaction: Epistemic problems arise when a logic is incomplete, because some of the so-called truths cannot be proved, and hence may be unreachable. This idea indicates Boolos's motivation for developing a theory of plural quantification. |
| 10225 | Monadic second-order logic might be understood in terms of plural quantifiers [Boolos, by Shapiro] |
| Full Idea: Boolos has proposed an alternative understanding of monadic, second-order logic, in terms of plural quantifiers, which many philosophers have found attractive. | |
| From: report of George Boolos (To be is to be the value of a variable.. [1984]) by Stewart Shapiro - Philosophy of Mathematics 3.5 |
| 10736 | Boolos showed how plural quantifiers can interpret monadic second-order logic [Boolos, by Linnebo] |
| Full Idea: In an indisputable technical result, Boolos showed how plural quantifiers can be used to interpret monadic second-order logic. | |
| From: report of George Boolos (To be is to be the value of a variable.. [1984], Intro) by Øystein Linnebo - Plural Quantification Exposed Intro |
| 10780 | Any sentence of monadic second-order logic can be translated into plural first-order logic [Boolos, by Linnebo] |
| Full Idea: Boolos discovered that any sentence of monadic second-order logic can be translated into plural first-order logic. | |
| From: report of George Boolos (To be is to be the value of a variable.. [1984], §1) by Øystein Linnebo - Plural Quantification Exposed p.74 |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| Full Idea: Going second-order in arithmetic enables us to prove new first-order arithmetical sentences that we couldn't prove before. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.4) | |
| A reaction: The wages of Satan, perhaps. We can prove things about objects by proving things about their properties and sets and functions. Smith says this fact goes all the way up the hierarchy. |
| 10015 | Higher-order logic may be unintelligible, but it isn't set theory [Hodes] |
| Full Idea: Brand higher-order logic as unintelligible if you will, but don't conflate it with set theory. | |
| From: Harold Hodes (Logicism and Ontological Commits. of Arithmetic [1984], p.131) | |
| A reaction: [he gives Boolos 1975 as a further reference] This is simply a corrective, because the conflation of second-order logic with set theory is an idea floating around in the literature. |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| Full Idea: Second-order logic is a powerful tool of definition: by means of it alone we can capture mathematical structure up to isomorphism using simple axiom systems. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 15944 | Second-order logic is better than set theory, since it only adds relations and operations, and nothing else [Shapiro, by Lavine] |
| Full Idea: Shapiro preferred second-order logic to set theory because second-order logic refers only to the relations and operations in a domain, and not to the other things that set-theory brings with it - other domains, higher-order relations, and so forth. | |
| From: report of Stewart Shapiro (Foundations without Foundationalism [1991]) by Shaughan Lavine - Understanding the Infinite VII.4 |
| 13629 | Broad standard semantics, or Henkin semantics with a subclass, or many-sorted first-order semantics? [Shapiro] |
| Full Idea: Three systems of semantics for second-order languages: 'standard semantics' (variables cover all relations and functions), 'Henkin semantics' (relations and functions are a subclass) and 'first-order semantics' (many-sorted domains for variable-types). | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: [my summary] |
| 13650 | Henkin semantics has separate variables ranging over the relations and over the functions [Shapiro] |
|
Full Idea:
In 'Henkin' semantics, in a given model |
|
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 3.3) |
| 13645 | In standard semantics for second-order logic, a single domain fixes the ranges for the variables [Shapiro] |
| Full Idea: In the standard semantics of second-order logic, by fixing a domain one thereby fixes the range of both the first-order variables and the second-order variables. There is no further 'interpreting' to be done. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 3.3) | |
| A reaction: This contrasts with 'Henkin' semantics (Idea 13650), or first-order semantics, which involve more than one domain of quantification. |
| 13649 | Completeness, Compactness and Löwenheim-Skolem fail in second-order standard semantics [Shapiro] |
| Full Idea: The counterparts of Completeness, Compactness and the Löwenheim-Skolem theorems all fail for second-order languages with standard semantics, but hold for Henkin or first-order semantics. Hence such logics are much like first-order logic. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: Shapiro votes for the standard semantics, because he wants the greater expressive power, especially for the characterization of infinite structures. |
| 10299 | If the aim of logic is to codify inferences, second-order logic is useless [Shapiro] |
| Full Idea: If the goal of logical study is to present a canon of inference, a calculus which codifies correct inference patterns, then second-order logic is a non-starter. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) | |
| A reaction: This seems to be because it is not 'complete'. However, moves like plural quantification seem aimed at capturing ordinary language inferences, so the difficulty is only that there isn't a precise 'calculus'. |
| 10298 | Some say that second-order logic is mathematics, not logic [Shapiro] |
| Full Idea: Some authors argue that second-order logic (with standard semantics) is not logic at all, but is a rather obscure form of mathematics. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) |
| 10594 | Henkin semantics is more plausible for plural logic than for second-order logic [Maddy] |
| Full Idea: Henkin-style semantics seem to me more plausible for plural logic than for second-order logic. | |
| From: Penelope Maddy (Second Philosophy [2007], III.8 n1) | |
| A reaction: Henkin-style semantics are presented by Shapiro as the standard semantics for second-order logic. |
| 19296 | If second-order variables range over sets, those are just objects; properties and relations aren't sets [Hale] |
| Full Idea: Contrary to what Quine supposes, it is neither necessary nor desirable to interpret bound higher-order variables as ranging over sets. Sets are a species of object. They should range over entities of a completely different type: properties and relations. | |
| From: Bob Hale (Necessary Beings [2013], 08.2) | |
| A reaction: This helpfully clarifies something which was confusing me. If sets are objects, then 'second-order' logic just seems to be the same as first-order logic (rather than being 'set theory in disguise'). I quantify over properties, but deny their existence! |
| 11024 | Semantics must precede proof in higher-order logics, since they are incomplete [Read] |
| Full Idea: For the realist, study of semantic structures comes before study of proofs. In higher-order logic is has to, for the logics are incomplete. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.9) | |
| A reaction: This seems to be an important general observation about any incomplete system, such as Peano arithmetic. You may dream the old rationalist dream of starting from the beginning and proving everything, but you can't. Start with truth and meaning. |
| 21657 | Since properties can have properties, some theorists rank them in 'types' [Hofweber] |
| Full Idea: Since properties themselves can have properties there is a well-known division in the theory of properties between those who take a typed and those who take a type-free approach. | |
| From: Thomas Hofweber (Ontology and the Ambitions of Metaphysics [2016], 08.5) | |
| A reaction: I take this idea to be about linguistic predicates, and about semantics which draws on model theory. To see it as about actual 'properties' in the physical world makes no sense. |
| 10704 | We can formalize second-order formation rules, but not inference rules [Potter] |
| Full Idea: In second-order logic only the formation rules are completely formalizable, not the inference rules. | |
| From: Michael Potter (Set Theory and Its Philosophy [2004], 01.2) | |
| A reaction: He cites Gödel's First Incompleteness theorem for this. |
| 15926 | Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine] |
| Full Idea: The distinctive feature of second-order logic is that it presupposes that, given a domain, there is a fact of the matter about what the relations on it are, so that the range of the second-order quantifiers is fixed as soon as the domain is fixed. | |
| From: Shaughan Lavine (Understanding the Infinite [1994], V.3) | |
| A reaction: This sounds like a rather large assumption, which is open to challenge. I am not sure whether it was the basis of Quine's challenge to second-order logic. He seems to have disliked its vagueness, because it didn't stick with 'objects'. |
| 10751 | Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg] |
| Full Idea: Second-order logic raises doubts because of its ontological commitment to the set-theoretic hierarchy, and the allegedly problematic epistemic status of the second-order consequence relation. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §1) | |
| A reaction: The 'epistemic' problem is whether you can know the truths, given that the logic is incomplete, and so they cannot all be proved. Rossberg defends second-order logic against the second problem. A third problem is that it may be mathematics. |
| 10757 | Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg] |
| Full Idea: Henkin semantics (for second-order logic) specifies a second domain of predicates and relations for the upper case constants and variables. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: This second domain is restricted to predicates and relations which are actually instantiated in the model. Second-order logic is complete with this semantics. Cf. Idea 10756. |
| 10759 | There are at least seven possible systems of semantics for second-order logic [Rossberg] |
| Full Idea: In addition to standard and Henkin semantics for second-order logic, one might also employ substitutional or game-theoretical or topological semantics, or Boolos's plural interpretation, or even a semantics inspired by Lesniewski. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: This is helpful in seeing the full picture of what is going on in these logical systems. |