Universal Generalization, if it is not the most poorly understood inference rule in natural deduction, then it is the least well explained or justified. The inference rule is, prima facie, quite ambitious: on the basis of a fact established of one thing, I may infer that the fact holds of every thing in the class to which the one belongs—a class which may contain indefinitely many things. How can such an inference be made with any confidence as to its validity (...) or ability to preserve truth from premise to conclusion? My goal in this paper is to explain how Universal Generalization works in a way that makes sense of its ability to preserve truth. In doing so, I shall review common accounts of Universal Generalization and explain why they are inadequate or are explanatorily unsatisfying. Happily, my account makes no ontological or epistemological presumptions and therefore should be compatible with whichever ontological or epistemological schemes the reader prefers. (shrink)

The notion of grounding is usually conceived as an objective and explanatory relation. It connects two relata if one—the ground—determines or explains the other—the consequence. In the contemporary literature on grounding, much effort has been devoted to logically characterize the formal aspects of grounding, but a major hard problem remains: defining suitable grounding principles for universal and existential formulae. Indeed, several grounding principles for quantified formulae have been proposed, but all of them are exposed to paradoxes in some very natural (...) contexts of application. We introduce in this paper a first-order formal system that captures the notion of grounding and avoids the paradoxes in a novel and non-trivial way. The system we present formally develops Bolzano’s ideas on grounding by employing Hilbert’s ε-terms and an adapted version of Fine’s theory of arbitrary objects. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

Two fundamental rules of reasoning are Universal Generalisation and Existential Instantiation. Applications of these rules involve stipulations such as ‘Let n be an arbitrary number’ or ‘Let John be an arbitrary Frenchman’. Yet the semantics underlying such stipulations are far from clear. What, for example, does ‘n’ refer to following the stipulation that n be an arbitrary number? In this paper, we argue that ‘n’ refers to a number—an ordinary, particular number such as 58 or 2,345,043. Which one? We do (...) not and cannot know, because the reference of ‘n’ is fixed arbitrarily. Underlying this proposal is a more general thesis: Arbitrary Reference : It is possible to fix the reference of an expression arbitrarily. When we do so, the expression receives its ordinary kind of semantic-value, though we do not and cannot know which value in particular it receives. Our aim in this paper is defend AR. In particular, we argue that AR can be used to provide an account of instantial reasoning, and we suggest that AR can also figure in offering new solutions to a range of difficult philosophical puzzles. (shrink)

Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

Ante rem structures were posited as the subject matter of mathematics in order to resolve a problem of referential indeterminacy within mathematical discourse. Nevertheless, ante rem structuralists are inevitably committed to the existence of indiscernible entities, and this commitment produces an exactly analogous problem. If it cannot be sorted out, then the postulation of ante rem structures is futile. In a recent paper, Stewart Shapiro argued that the problem may be solved by analysing some of the singular terms of mathematics (...) not as genuinely referring expressions, but as instantial terms. In this paper, I discuss several competing accounts of the semantics of terms of this kind, and argue that they are all untenable for the ante rem structuralist. Shapiro, then, still owes us an account of the semantics of instantial terms that suits the ante rem structuralist project. Without it, the ante rem structuralist is still unable to determine the reference of the singular terms of mathematics. (shrink)

Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...) results were obtained by Andréka and Németi (1994) using the methods of algebraic logic. (shrink)

In the literature, there have been several methods and definitions for working out whether two theories are “equivalent” or not. In this article, we do something subtler. We provide a means to measure distances between formal theories. We introduce two natural notions for such distances. The first one is that of axiomatic distance, but we argue that it might be of limited interest. The more interesting and widely applicable notion is that of conceptual distance which measures the minimum number of (...) concepts that distinguish two theories. For instance, we use conceptual distance to show that relativistic and classical kinematics are distinguished by one concept only. (shrink)

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)

Inspired by Kit Fine’s theory of arbitrary objects, we explore some ways in which the generic structure of the natural numbers can be presented. Following a suggestion of Saul Kripke’s, we discuss how basic facts and questions about this generic structure can be expressed in the framework of Carnapian quantified modal logic.

We present a faithful axiomatization of von Mises' notion of a random sequence, using an abstract independence relation. A byproduct is a quantifier elimination theorem for Friedman's "almost all" quantifier in terms of this independence relation.

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant logics with identity and a (...) discussion of constant and variable domains. (shrink)

We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for natural language processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in natural language in two ways: the structure of representations mirrors the structure of the language and allows re-use phenomena such as pronouns and (...) ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of natural language sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for natural language processing tasks is illustrated. (shrink)

In this paper I argue that in contrast to natural languages, logical languages typically are not compositional. This does not mean that the meaning of expressions cannot be determined at all using some well-defined set of rules. It only means that the meaning of an expression cannot be determined without looking at its form. If one is serious about the compositionality of a logic, the only possibility I see is to define it via abstraction from a variable free language.