The paper uses the theory of generalized quantifiers to discuss existential import and its implications for Aristotelian logic, namely the square of opposition, conversions and the assertoric syllogistic, as well as for more recent generalizations to intermediate quantifiers like “most”. While this is a systematic discussion of the semantic background one should assume in order to obtain the inferences and oppositions Aristotle proposed, it also sheds some light on the interpretation of his writings. Moreover by applying tools from modern formal (...) semantics to the investigation of classical Aristotelian logic and its extensions, we combine different approaches to the logic of quantification. We will present variants of quantifiers that are associated to the four corners of the square of opposition with and without existential import and discuss their role for the logical square, conversions and the syllogistic. It will turn out that there is no way to ascribe existential import that validates all inferences and relations which one is willing to hold in Aristotelian logic. Two options, however, provide reasonable results. Existential import should either be ascribed only to affirmative statements or only be ascribed to universal quantification. The former option is preferable for a mere reconstruction of the classical Aristotelian logic while the latter option is more attractive if Aristotelian logic is generalized to intermediate quantifiers. (shrink)

We give an axiomatization of first‐order logic enriched with the almost‐everywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible extensions of these results to the almost‐everywhere quantifier over countably additive measures.

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

Consider syllogisms in which fraction (percentage) quantifiers are permitted in addition to universal and particular quantificrs, and then include further quantifiers which are modifications of such fractions (such as "almost ½ the S are P" and "Much more than ½ the S are P"). Could a syllogistic system containing such additional categorical forms be coherent? Thompson's attempt (1986) to give rules for determining validity of such syllogisms has failed; cf. Carnes & Peterson (forthcoming) for proofs of the unsoundness and incompleteness (...) of Thompson's rules. Building on Peterson (1985), the coherence of such a syllogistic can, however, be demonstrated with an algebra which provides its semantics; e.g., "almost ¾ the S arc P'" is represented as " -(3(SP) » SP)". (shrink)

In this paper, we provide an overview of some of the results obtained in the mathematical theory of intermediate quantifiers that is part of fuzzy natural logic. We briefly introduce the mathematical formal system used, the general definition of intermediate quantifiers and define three specific ones, namely, “Almost all”, “Most” and “Many”. Using tools developed in FNL, we present a list of valid intermediate syllogisms and analyze a generalized 5-square of opposition.

In this publication we continue the study of fuzzy Peterson’s syllogisms. While in the previous publication we focused on verifying the validity of these syllogisms using the construction of formal proofs and semantic verification, in this publication we focus on verifying the validity of syllogisms using Peterson’s rules based on grades.

The main objective of this paper is devoted to two main parts. First, the paper introduces logical interpretations of classical structures of opposition that are constructed as extensions of the square of opposition. Blanché’s hexagon as well as two cubes of opposition proposed by Morreti and pairs Keynes–Johnson will be introduced. The second part of this paper is dedicated to a graded extension of the Aristotle’s square and Peterson’s square of opposition with intermediate quantifiers. These quantifiers are linguistic expressions such (...) as “most”, “many”, “a few”, and “almost all”, and they correspond to what are often called “fuzzy quantifiers” in the literature. The graded Peterson’s cube of opposition, which describes properties between two graded squares, will be discussed at the end of this paper. (shrink)

In the study of natural language quantification, much recent attention has been devoted to the investigation of verification procedures associated with the proportional quantifier most. The aim of these studies is to go beyond the traditional characterization of the semantics of most, which is confined to explicating its truth-functional and presuppositional content as well as its combinatorial properties, as these aspects underdetermine the correct analysis of most. The present paper contributes to this effort by presenting new experimental evidence in support (...) of a decompositional analysis of most according to which it is a superlative construction built from a gradable predicate many or much and the superlative operator -est. Our evidence comes in the form of verification profiles for sentences like Most of the dots are blue which, we argue, reflect the existence of a superlative reading of most. This notably contrasts with Lidz et al.’s results. To reconcile the two sets of data, we argue, it is necessary to take important differences in task demands into account, which impose limits on the conclusions that can be drawn from these studies. (shrink)

The numerically definite syllogistic is the fragment of English obtained by extending the language of the classical syllogism with numerical quantifiers. The numerically definite relational syllogistic is the fragment of English obtained by extending the numerically definite syllogistic with predicates involving transitive verbs. This paper investigates the computational complexity of the satisfiability problem for these fragments. We show that the satisfiability problem (= finite satisfiability problem) for the numerically definite syllogistic is strongly NP-complete, and that the satisfiability problem (= finite (...) satisfiability problem) for the numerically definite relational syllogistic is NEXPTIME-complete, but perhaps not strongly so. We discuss the related problem of probabilistic (propositional) satisfiability, and thereby demonstrate the incompleteness of some proof-systems that have been proposed for the numerically definite syllogistic. (shrink)

En esta contribución proponemos una representación de un fragmento de la silogística estadística de Thompson usando la lógica de términos de Sommers. El resultado es una interpretación terminista de la silogística estadística.

A novel theoretical formulation of Categorical Logic based on two properties of categorical propositions and three simple axioms has been introduced recently. This formulation allowed for the suppression of the distinction between immediate and mediate inferences, and also provided a theoretical framework to study opposition relations, thus restoring the theoretical unity of traditional Aristotelian logic. By using this approach, it has been reported that a total of 3072 conclusive syllogistic moods can be found when including indefinite terms in classical syllogistic, (...) but this result has yet to be proven. This paper presents an overview of the recently proposed theoretical formulation of Categorical Logic, along with the derivation of the 48 canonical syllogistic moods that are capable of generating the 3072 conclusive moods previously reported. (shrink)