This article enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: Allxareyand Somexarey, There are at least as manyxasy, and There are morexthany. Herexandyrange over subsets (not elements) of a giveninfiniteset. Moreover,xandymay appear complemented (i.e., as$\bar{x}$and$\bar{y}$), with the natural meaning. We formulate a logic for our language that is based on the classical syllogistic. The main result is a soundness/completeness theorem. (...) There are efficient algorithms for proof search and model construction. (shrink)

Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus ‘grassroots mathematics’.We begin with a brief review of by changing the semantics of counting in natural ways. A first approach replaces cardinalities by abstract but well-motivated values of ‘mass’ or other mereological aggregating notions. A second approach (...) keeps the cardinalities but generalizes the meaning of counting to work in models that allow dependencies between variables.Finally, we return to our starting point in natural language, confronting the architecture of our formal systems with linguistic quantifier vocabulary and syntax, as well as with natural reasoning modules such as the monotonicity calculus. In addition to these encounters with formal semantics, we discuss the role of counting in semantic evaluation procedures for quantifier expressions and determine, for instance, which binary quantifiers are computable by finite ‘semantic automata’. We conclude with some general thoughts on yet further entanglements of logic and counting in formal systems, on rethinking the qualitative/quantitative divide, and on connecting our analysis to empirical findings in cognitive science. (shrink)

We introduce a novel set-intersection operator called ‘most-intersection’ based on the logical quantifier ‘most’, via natural density of countable sets, to be used in determining the majority chara...

We show that derivations in the nonassociative and commutative Lambek calculus with product can be transformed to a normal form as it is the case with derivations in noncommutative calculi. As an application we obtain that the class of languages generated by categorial grammars based on the nonassociative and commutative Lambek calculus with product is included in the class of CF-languages. MSC: 68Q50, 03D15, 03B65.

In this paper we describe a framework for the construction of entities that can serve as interpretations of arbitrary contiguous chunks of text. An important part of the paper is devoted to describing stacking cells, or the proposed meanings for bracket-structures.

This paper motivates the logic PCON, an extension of connexivity to conjunction and disjunction, called poly-connexivity. The motivation arises from differences in intonational stress patterns due to focus, where PCON turns out to be a logic of intentionally stressed connectives in focus.

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

In this paper, we axiomatize the deontic logic in Fusco (2015), which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the restrictions (...) Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to “lift” a Kripke frame for a one-dimensional modal logic into two dimensions. (shrink)

We investigate whether ordinary quantification over objects is an extensional phenomenon, or rather creates non-extensional contexts; each claim having been propounded by prominent philosophers. It turns out that the question only makes sense relative to a background theory of syntax and semantics (here called a grammar) that goes well beyond the inductive definition of formulas and the recursive definition of satisfaction. Two schemas for building quantificational grammars are developed, one that invariably constructs extensional grammars (in which quantification, in particular, thus (...) behaves extensionally) and another that only generates non-extensional grammars (and in which quantification is responsible for the failure of extensionality). We then ask whether there are reasons to favor one of these grammar schemas over the other, and examine an argument according to which the proper formalization of deictic utterances requires adoption of non-extensional grammars. (shrink)

Can one quantify over absolutely everything? Absolutists answer positively, while relativists answer negatively. Here, I focus on the absolutism versus relativism debate in the framework of theories of truth, where relativism becomes a form of contextualism about truth predications. Contextualist theories of truth provide elegant and uniform solutions to the semantic paradoxes while preserving classical logic. However, they interpret harmless generalizations (such as “everything is self-identical”) in less than absolutely comprehensive domains, thus systematically misconstruing them. In this article, I show (...) that contextualism is broadly compatible with absolute generality. More specifically, I develop a bipartite contextualist semantics, or “bicontextualism,” on which sentences are split in two groups: the unproblematic sentences, which are compatible with absolute generality, and the problematic ones, which are given a relativist semantics. I then argue that bicontextualism retains the advantages of (orthodox) contextualism and does not give rise to new revenge paradoxes. (shrink)

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.

Neo-Fregeanism aims to provide a possible route to knowledge of arithmetic via Hume’s principle, but this is of only limited significance if it cannot account for how the vast majority of arithmetic knowledge, accrued by ordinary people, is obtained. I argue that Hume’s principle does not capture what is ordinarily meant by numerical identity, but that we can do much better by buttressing plural logic with plural versions of the ancestral operator, obtaining natural and plausible characterizations of various key arithmetic (...) concepts, including finiteness, equinumerosity and addition and multiplication of cardinality—revealing these to be logical concepts, and obtaining much of ordinary arithmetic knowledge as logical knowledge. Supplementing this with an abstraction principle and a simple axiom of infinity (known either empirically or modally) we obtain a full interpretation of arithmetic. (shrink)

The aim of this paper is to provide a complete Natural Kind Semantics for an Essentialist Theory of Kinds. The theory is formulated in two-sorted first order monadic modal logic with identity. The natural kind semantics is based on Rudolf Willes Theory of Concept Lattices. The semantics is then used to explain several consequences of the theory, including results about the specificity (species–genus) relations between kinds, the definitions of kinds in terms of genera and specific differences and the existence of (...) negative kinds. First, I show under which conditions the Hierarchy principle, which has been subjected to counterexamples in the literature, holds. I also show that a different principle about the species–genus relations between kinds, namely Kant’s Law, follows from the essentialist theory. Second, I introduce two new operations for kinds and show that they can be used to provide traditional definitions of kinds in terms of genera and specific differences. Finally, I show that these operations of specific difference induce, for each kind, a uniquely specified contrary kind and a uniquely specified subcontrary kind, which can be used as semantic values for non-classical predicate negations of kind terms. (shrink)