In this paper we re-examine the semantics of classical higher-order logic with the purpose of clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher-order models with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Furthermore, we develop a methodology of abstract consistency methods (by providing the necessary model existence theorems) needed to analyze completeness of (machine-oriented) higher-order calculi with respect to these model (...) classes. (shrink)

Recently, some philosophers have argued that we should take quantification of any (finite) order to be a legitimate and irreducible, sui generis kind of quantification. In particular, they hold that a semantic theory for higher-order quantification must itself be couched in higher-order terms. Øystein Linnebo has criticized such views on the grounds that they are committed to general claims about the semantic values of expressions that are by their own lights inexpressible. I show that Linnebo’s (...) objection rests on the assumption of a notion of semantic value or contribution which both applies to expressions of any order, and picks out, for each expression, an extra-linguistic correlate of that expression. I go on to argue that higher-orderists can plausibly reject this assumption, by means of a hierarchy of notions they can use to describe the extra-lingustic correlates of expressions of different orders. (shrink)

In this paper, we show that Higher{Order Coloured Uni cation { a form of uni cation developed for automated theorem proving { provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)'s analysis called for.

CHAPTER 1. INTENSIONAL LOGIC §1. Natural Language and Intensional Logic When we speak of a theory of meaning for a natural language such as English, ...

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E. In contrast to the well-known interpretation of higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE, but rather by a suitable complete Heyting algebra H. The canonical map relating H and ΩE both serves to interpret equality and provides a modal operator on H in the form of a comonad. Examples of such structures arise (...) from surjective geometric morphisms f : F → E, where H = f∗ΩF. The logic differs from non-modal higher-order logic in that the principles of functional and propositional extensionality are not longer valid but may be replaced by modalized versions. The usual Kripke, neighborhood, and sheaf semantics for propositional and first-order modal logic are subsumed by this notion. (shrink)

In this article, a qualitative notion of subjective plausibility and its revision based on a preorder relation are implemented in higher-order logic. This notion of plausibility is used for modeling pragmatic aspects of communication on top of traditional two-dimensional semantic representations.

A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including "subtypes", for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.

The paper presents a new theory of higher-order vagueness. This theory is an improvement on current theories of vagueness in that it (i) describes the kind of borderline cases relevant to the Sorites paradox, (ii) retains the ‘robustness’ of vague predicates, (iii) introduces a notion of higher-order vagueness that is compositional, but (iv) avoids the paradoxes of higher-order vagueness. The theory’s central building-blocks: Borderlinehood is defined as radical unclarity. Unclarity is defined by means of (...) competent, rational, informed speakers (‘CRISPs’) whose competence, etc., is indexed to the scope of the unclarity operator. The unclarity is radical since it eliminates clear cases of unclarity and, that is, clear borderline cases. This radical unclarity leads to a (bivalence-compatible, non-intuitionist) absolute agnosticism about the semantic status of all borderline cases. The corresponding modal system would be a non-normal variation on S4M. (shrink)

Several philosophers of science construe models of scientific theories as set-theoretic structures. Some of them moreover claim that models should not be construed as structures in the sense of model theory because the latter are language-dependent. I argue that if we are ready to construe models as set-theoretic structures (strict semantic view), we could equally well construe them as model-theoretic structures of higher-order logic (liberal semantic view). I show that every family of set-theoretic structures has an associated language (...) of higher-order logic and an up to signature isomorphism unique model-theoretic counterpart, which is able to serve the same purposes. This allows to carry over every syntactic criterion of equivalence for theories in the sense of the liberal semantic view to theories in the sense of the strict semantic view. Taken together, these results suggest that the recent dispute about the semantic view and its relation to the syntactic view can be resolved. (shrink)

A theory of higher-order vagueness for partially-defined, context-sensitive predicates like is blue is offered. According to the theory, the predicate is determinately blue means roughly is an object o such that the claim that o is blue is a necessary consequence of the rules of the language plus the underlying non-linguistic facts in the world. Because the question of which rules count as rules of the language is itself vague, the predicate is determinately blue is both vague and (...) partial in a sense analogous (though not completely identical) to the sense in which is blue is vague and partial. However, higher-order vagueness stops there. Although the anti-extension of is determinately blue differs from that of is blue, further iterations of determinately have no semantic effect. The paper closes with a discussion of the need to posit sharp and precise lines dividing the range of potential application of a vague predicate into semantically distinct categories. It is argued that this is less of a problem for the present theory than for many others, because the categories into which the range is divided by the present theory -- like the category of counting as blue because the rules of the language offer speakers no discretion, as opposed to the category of counting as blue because speakers have invoked an absolute minimum of discretion in adjusting the contextually sensitive boundaries of the predicate -- are not those that the linguistic competence of ordinary speakers equips them to make highly accurate and reliable judgments about. (shrink)

Most descriptions of higher-order vagueness in terms of traditional modal logic generate so-called higher-order vagueness paradoxes. The one that doesn't is problematic otherwise. Consequently, the present trend is toward more complex, non-standard theories. However, there is no need for this.In this paper I introduce a theory of higher-order vagueness that is paradox-free and can be expressed in the first-order extension of a normal modal system that is complete with respect to single-domain Kripke-frame (...) class='Hi'>semantics. This is the system QS4M+BF+FIN. It corresponds to the class of transitive, reflexive and final frames. With borderlineness defined logically as usual, it then follows that something is borderline precisely when it is higher-order borderline, and that a predicate is vague precisely when it is higher-order vague.Like Williamson's, the theory proposed here has no clear borderline cases in Sorites sequences. I argue that objections that there must be clear borderline cases ensue from the confusion of two notions of borderlineness—one associated with genuine higher-order vagueness, the other employed to sort objects into categories—and that the higher-order vagueness paradoxes result from superimposing the second notion onto the first. Lastly, I address some further potential objections. (shrink)

Higher-order vagueness is widely thought to be a feature of vague predicates that any adequate theory of vagueness must accommodate. It takes a variety of forms. Perhaps the most familiar is the supposed existence, or at least possibility, of higher-order borderline cases—borderline borderline cases, borderline borderline borderline cases, and so forth. A second form of higherorder vagueness, what I will call ‘prescriptive’ higher-order vagueness, is thought to characterize complex predicates constructed from vague predicates by (...) attaching operators having to do with the predicates’ proper application. For example, the predicates ‘mandates application of “old”’ and ‘can competently be called “old”’ are prescriptively higher-order vague. Higher-order vagueness appears in other guises as well,1 but these two have been of particular interest to philosophers and will be my target here. I want to expose some misconceptions about them. If I am right, higher-order vagueness is less prevalent, and less important theoretically, than is usually supposed.2 In what follows I am going to assume that vagueness is a semantic feature of natural language. For the most part I won’t discuss epistemic or pragmatic views, and I will say nothing about so-called metaphysical vagueness. (shrink)

In most cases, a wh-question calls for an answer that names an entity in the set denoted by the extension of the wh-complement. However, evidence from questions with necessity modals and questions with collective predicates argues that sometimes a wh-question must be interpreted with a higher-order reading, in which this question calls for an answer that names a generalized quantifier. This paper investigates the distribution and compositional derivation of higher-order readings of wh-questions. First, I argue that (...) the generalized quantifiers that can serve as semantic answers to wh-questions must be homogeneously positive. Next, on the distribution of higher-order readings, I observe that questions in which the wh-complement is singular-marked or numeral-modified can be answered by elided disjunctions but not by conjunctions. I further present two ways to account for this disjunction–conjunction asymmetry. In the uniform account, these questions admit disjunctions because disjunctions may satisfy the atomicity requirement of singular-marking and the cardinality requirement of numeral modification. In the reconstruction account, the wh-complement is syntactically reconstructed, which gives rise to local uniqueness and yields a contradiction for conjunctive answers. (shrink)

Higher order unification is a way of combining information (or equivalently, solving equations) expressed as terms of a typed higher order logic. A suitably restricted form of the notion has been used as a simple and perspicuous basis for the resolution of the meaning of elliptical expressions and for the interpretation of some non-compositional types of comparative construction also involving ellipsis. This paper explores another area of application for this concept in the interpretation of sentences containing (...) intonationally marked focus, or various semantic constructs which are sensitive to focus.Similarities and differences between this approach, and theories using alternative semantics, structured meanings, or flexible categorial grammars, are described. The paper argues that the higher order unification approach offers descriptive advantages over these alternatives, as well as the practical advantage of being capable of fairly direct computational implementation. (shrink)

This Element is an exposition of second- and higher-order logic and type theory. It begins with a presentation of the syntax and semantics of classical second-order logic, pointing up the contrasts with first-order logic. This leads to a discussion of higher-order logic based on the concept of a type. The second Section contains an account of the origins and nature of type theory, and its relationship to set theory. Section 3 introduces Local Set (...) Theory, an important form of type theory based on intuitionistic logic. In Section 4 number of contemporary forms of type theory are described, all of which are based on the so-called 'doctrine of propositions as types'. We conclude with an Appendix in which the semantics for Local Set Theory - based on category theory - is outlined. (shrink)

W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due (...) in large measure to developments stemming from Carnap’s studies and culminating in the work of Kripke, Hintikka, and Bayart. These developments undermined Quine’s crusade against intensions on two fronts. First, in the context of possible world semantics, intensions could after all be given rigorous identity conditions by defining them (in the simplest case) as functions from worlds to appropriate extensions, a fact exploited to powerful and influential effect in logic and linguistics by the likes of Kaplan, Montague, Lewis, and Cresswell. Second, the rise of possible world semantics fueled a strong resurgence of metaphysics in contemporary analytic philosophy that saw properties and propositions widely, fruitfully, and unabashedly adopted as ontological primitives in their own right. This resurgence — happily, in my view — continues into the present day. -/- For a time, at any rate, Quine experienced somewhat better success with his second thesis: that higher-order logic is, at worst, confused and, at best, a quirky notational alternative to standard first-order logic. However, Quine notwithstanding, a great deal of recent work in formal metaphysics transpires in a higher-order logical framework in which properties and propositions fall into an infinite hierarchy of types of (at least) every finite order. Initially, the most philosophically compelling reason for embracing such a framework since Russell first proposed his simple theory of types was simply that it provides a relatively natural explanation of the paradoxes. However, since the seminal work of Prior there has been a growing trend to consider higher-order logic to be the most philosophically natural framework for metaphysical inquiry, many of the contributors to this volume being among the most important and influential advocates of this view. Indeed, this is now quite arguably the dominant view among formal metaphysicians. -/- In this paper, and against the current tide, I will argue in §1 that there are still good reasons to think that Quine’s second battle is not yet lost and that the correct framework for logic is first-order and type-free — properties and propositions, logically speaking, are just individuals among others in a single domain of quantification — and that it arises naturally out of our most basic logical and semantical intuitions. The data I will draw upon are not new and are well-known to contemporary higher-order metaphysicians. However, I will try to defend my thesis in what I believe is a novel way by suggesting that these basic intuitions ground a reasonable distinction between “pure” logic and non-logical theory, and that Russell-style semantic paradoxes of truth and exemplification arise only when we move beyond the purely logical and, hence, do not of themselves provide any strong objection to a type-free conception of properties and propositions. -/- Most of my arguments in §1 are largely independent of any specific account of the nature of properties and propositions beyond their type-freedom. However, I will in addition argue that there are good reasons to take propositions, at least, to be very fine-grained. My arguments are thus bolstered significantly if it can be shown that there are in fact well-defined examples of logics that are not only type-free but which comport with such a conception of propositions. It is the purpose of §2 to lay out a logic of this sort in some detail, drawing especially upon work by George Bealer and related work of my own. With the logic in place, it will be possible to generalize the line of argument noted above regarding Russell-style paradoxes and, in §3, apply it to two propositional paradoxes — the Prior-Kaplan paradox and the Russell-Myhill paradox — that are often taken to threaten the sort of account developed here. (shrink)

Higher-order representation (HOR) theories posit that the contents of lower-order brain states enter consciousness when tracked by a higher-order brain state. The nature of higher-order monitoring was examined in light of current scientific knowledge, primarily in experimental perceptual psychology. The most plausible candidate for higher-order state was found to be conceptual short-term memory (CSTM), a buffer memory intimately connected with a semantic engine operating in the medium of the language of thought (...) (LOT). This combination meets many of the requirements of HOR theories, although falling short in some significant respects, most notably the inability of higher- order states to represent more than a small fraction of the information contained in primary states, especially in vision. A possible way round this obstacle is suggested, involving the representation of visual detail by means of ensemble concepts. (shrink)

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since (...) it has to take the theory of αβη-equality into account. As a consequence, the higher-order unification problem is undecidable and sets of solutions need not even always have most general elements that represent them. Thus the mentioned calculi for higher-order logic have take special measures to circumvent the problems posed by the theoretical complexity of higher-order unification. In this paper, we will exemplify the methods and proof- and model-theoretic tools needed for extending first-order automated theorem proving to higherorder logic. For the sake of simplicity take the tableau method as a basis (for a general introduction to first-order tableaux see part I.1) and discuss the higherorder tableau calculi HT and HTE first presented in [19]. The methods in this paper also apply to higher-order resolution calculi [1, 13, 6] or the higher-order matings method of Peter [3], which extend their first-order counterparts in much the same way. Since higher-order calculi cannot be complete for the standard semantics by Gödel’s incompleteness theorem [11], only the weaker notion of Henkin models [12] leads to a meaningful notion of completeness in higher-order logic. It turns out that the calculi in [1, 13, 3, 19] are not Henkin-complete, since they fail to capture the extensionality principles of higher-order logic. We will characterize the deductive power of our calculus HT (which is roughly equivalent to these calculi) by the semantics of functional Σ-models. To arrive at a calculus that is complete with respect to Henkin models, we build on ideas from [6] and augment HT with tableau construction rules that use the extensionality principles in a goal-oriented way.. (shrink)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] (...) and substantially using a third-order accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

1. Argumentation, by considering arguments and their interactions, is a way of reasoning that has proven successful in many contexts, for instance, in multi-agent applications (Carrera & Iglesias,...

The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness theorem for K∞α is proved by the method of reduction trees, and it is shown that every model of K∞α is equivalent to a cumulative hierarchy of sets. This is used to show that several axiomatic first-order set theories can be interpreted in K∞α, for suitable α.

The purpose of this article is show that second-order logic, as understood through standard semantics, is intimately bound up with set theory, or some other general theory of interpretations, structures, or whatever. Contra Quine, this does not disqualify second-order logic from its role in foundational studies. To wax Quinean, why should there be a sharp border separating mathematics from logic, especially the logic of mathematics?

Discussions of higher-order vagueness rarely define what it is for a term to have nth-order vagueness for n>2. This paper provides a rigorous definition in a framework analogous to possible worlds semantics; it is neutral between epistemic and supervaluationist accounts of vagueness. The definition is shown to have various desirable properties. But under natural assumptions it is also shown that 2nd-order vagueness implies vagueness of all orders, and that a conjunction can have 2nd-order vagueness (...) even if its conjuncts do not. Relations between the definition and other proposals are explored; reasons are given for preferring the present proposal. (shrink)

ABSTRACT This paper introduces a multi-valued variant of higher-order resolution and proves it correct and complete with respect to a variant of Henkin's general model semantics. This resolution method is parametric in the number of truth values as well as in the particular choice of the set of connectives (given by arbitrary truth tables) and even substitutional quantifiers. In the course of the completeness proof we establish a model existence theorem for this logical system. The work reported (...) in this paper provides a basis for developing higher-order mechanizations for many non-classical logics. (shrink)

Special quantifiers are quantifiers like 'something', 'everything', and 'several things'. They are special both semantically and syntactically and play quite an important role in philosophy, in discussions of ontological commitment to abstract objects, of higher-order metaphysics, and of the apparent need for propositions. This paper will review and discuss in detail the syntactic and semantic peculiarities of special quantifiers and show that they are incompatible with substitutional and higher-order analyses that have recently been proposed. It instead (...) defends and develops in formal detail a semantic analysis of special quantifiers as nominalizing quantifiers. On this analysis, special quantifiers involve both singular objectual quantification and implicit on non-singular (higher-order, plural, or mass) quantification. The analysis rests on a range of recent insights and proposals in generative syntactic theory, in particular the recognition of '–thing' as a light noun and a potential classifier as well as recent views of the decomposition of attitudinal and locutionary verbs in syntax. (shrink)

So-called 'dynamic' semantic theories such as Kamp's discourse representation theory and Heim's file change semantics account for such phenomena as cross-sentential anaphora, donkey anaphora, and the novelty condition on indefinites, but compare unfavorably with Montague semantics in some important respects (clarity and simplicity of mathematical foundations, compositionality, handling of quantification and coordination). Preliminary efforts have been made by Muskens and by de Groote to revise and extend Montague semantics to cover dynamic phenomena. We present a new (...) class='Hi'>higher-order theory of discourse semantics which improves on their accounts by incorporating a more articulated notion of context inspired by ideas due to David Lewis and to Craige Roberts. On our account, a context consists of a common ground of mutually accepted propositions together with a set of discourse referents preordered by relative salience. Employing a richer notion of contexts enables us to extend our coverage beyond pronominal anaphora to a wider range of presuppositional phenomena, such as the factivity of certain sentential-complement verbs, resolution of anaphora associated with arbitrarily complex definite descriptions, presupposition 'holes' such as negation, and the independence condition on the antecedents of conditionals. Formally, our theory is expressed within a higher-order logic with natural number type, separation-style subtyping, and dependent coproducts parameterized by the natural numbers. The system of semantic types builds on proposals due to Thomason and to Pollard in which the type of propositions (static meanings of sentential utterances) is taken as basic and worlds are constructed from propositions (rather than the other way around as in standard Montague semantics). (shrink)

First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal logic: its formal (...) semantics, and a proof procedure using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in G¨ odel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation. (shrink)

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the verdicts, hypotheses, or conjectures of any science. In work currently in progress, we argue for the unique suitability of LF for the formalization of logic, mathematics, syntax, and semantics. The present document specifies the language and rules (...) of LF, lays out some notational conventions, and states some basic technical facts about the system. (shrink)

We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ω defines exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with ∑ 1 b -induction over PV ω and use this to re-establish that the provably total functions in this system are polynomial (...) time computable. Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion. (shrink)

The idea of higher-order vagueness is usually associated with conceptions of vagueness that focus on the existence of borderline cases. What sense can be made of it within a conception of vagueness that focuses on tolerance instead? A proposal is offered here. It involves understanding ‘definitely’ not as a sentence operator but as a predicate modifier, and more precisely as an intensifier, that is, an operator that shifts the predicate extension along a scale. This idea is combined with (...) the author’s earlier approach to the semantics of vague expressions, which builds on the idea of a central gap associated with a predicate. The central gap approach is generalized to handle arbitrarily many iterations of ‘definitely’. (shrink)

In ‘Epistemic Modals’ (2007), Seth Yalcin proposes Stalnaker-style semantics for epistemic possibility. He is inspired by John MacFarlane’s ingenious defence of relativism, in which claims of epistemic possibility are made rigidly from the perspective of the assessor’s actual stock of information (rather than from the speaker’s knowledge base or that of his audience or community). The innovations of MacFarlane and Yalcin independently reinforce the modal collapse espoused by Jaakko Hintikka in his 1962 epistemic logic (which relied on the implausible (...) KK principle and heavy idealizations). I respond to this new challenge with fresh objections to the underlying S4 equivalence: p p . I also propose counter-analyses of the intriguing data which Yalcin cites in support of his new semantics. A key collateral motivation for this defence of irredundant iterations is to ward off a threat to higher order vagueness. (shrink)

Functions of type n are characteristic functions on n-ary relations. In Beyond the Frege Boundary [6], Keenan established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, where he called a function of type n reducible if it can be represented as a composition of functions of type 1 . We will give a normal form theorem for functions of type n , and use this to show that natural (...) language has many examples of irreducible type n functions in a much stronger sense, where we take a function to be reducible if it can be represented as a composition of functions of lower types. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces-so-called "topological semantics". The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause source of the ellipsis, our analysis requires no such hidden ambiguity. Further, the analysis follows relatively directly from an abstract statement of the ellipsis interpretation problem. It predicts correctly a wide range of interactions between ellipsis and other semantic phenomena such as quantifier scope and bound anaphora. Finally, although the (...) analysis itself is stated nonprocedurally, it admits of a direct computational method for generating interpretations. (shrink)

Prior’s problem consists in the impossibility of replacing clausal complements of most attitude verbs by ‘ordinary’ NPs; only ‘special quantifiers’ that is, quantifiers like 'something' permit a replacement, preserving grammaticality or the same reading of the verb: (1) a. John claims that he won. b. ??? John claims a proposition / some thing. c. John claims something. In my 2013 book Abstract Objects and the Semantics of Natural Language, I have shown how this generalizes to nonreferential complements of various (...) other intensional predicates and argued for a Nominalization Theory of special quantifiers. In this paper, I will review and extend the range of linguistic generalizations that motivate the Nominalization Theory and show that they pose serious problems for higher-order and substitutional analyses of special quantifiers. (shrink)

Suppose you hold the following opinions in the philosophy of logic. First-order predicate logic is expressively inadequate to regiment concepts of mathematic and natural language; logicism is plausible and attractive; set theory as an adjunct to logic is unnatural and ontologically extravagant; humanly usable languages are finite in lexicon and syntax; it is worth striving for a Tarskian semantics for mathematics; there are no Platonic abstract objects. Then you are probably already in cognitive distress. One way to decease (...) your unhappiness, short for embracing Platonism, is to accept higher-order logic and look, as did Arthur Prior, for a plausible way to neutralize the ontological commitment to abstract entities that this acceptance appears to entail. (shrink)

Suppose you hold the following opinions in the philosophy of logic. First-order predicate logic is expressively inadequate to regiment concepts of mathematic and natural language; logicism is plausible and attractive; set theory as an adjunct to logic is unnatural and ontologically extravagant; humanly usable languages are finite in lexicon and syntax; it is worth striving for a Tarskian semantics for mathematics; there are no Platonic abstract objects. Then you are probably already in cognitive distress. One way to decease (...) your unhappiness, short for embracing Platonism, is to accept higher-order logic and look, as did Arthur Prior, for a plausible way to neutralize the ontological commitment to abstract entities that this acceptance appears to entail. (shrink)

The HOU-based analysis of ellipsis was shown byDalrymple et al. (1991) and Shieber et al. (1996) to correctly capture thecomplex interaction of VP-ellipsis, scope and anaphora and claimed toextend to further related phenomena. When applied to deaccenting, theanalysis makes a strong prediction, namely that all anaphors occurringin the deaccented part of a deaccented utterance are parallelanaphors, i.e., anaphors that resolve to their parallel counterpart inthe source. I argue that this prediction is supported by the data andshow that it correctly captures (...) the interaction of deaccenting withanaphora, (in)definiteness and focus. (shrink)

In this paper a proposal by Henkin of a nominalistic interpretation for second and higher-order logic is developed in detail and analysed. It was proposed as a response to Quine’s claim that second and higher-order logic not only are committed to the existence of sets, but also are committed to the existence of more sets than can ever be referred to in the language. Henkin’s interpretation is rarely cited in the debate on semantics and ontological (...) commitments for these logics, though it has many interesting ideas that are worth exploring. The detailed development will show that it employs an early strategy of using substitutional quantification in order to reduce ontological commitments. It will be argued that the perspective adopted for the predicate variables renders it a natural extension of Quine’s nominalistic interpretation for first-order logic. However, we will argue that, with respect to Quine’s nominalistic program and his notion of ontological commitment, still holds and thus Henkin’s interpretation is not nominalistic. Nevertheless, it will be seen that is addressed successfully and this provides further insights on the so-called “Skolem Paradox”. Moreover, the interpretation is ontologically parsimonious and, in this respect, it arguably fares better than a recent proposal by Bob Hale. (shrink)