The purpose of this paper is to contribute to the natural logic program which invents logics in natural language. This study presents two logics: a logical system called d R containing transitive verbs and a more expressive logical system R containing both transitive verbs and intersective adjectives. The paper offers three different set-theoretic semantics which are equivalent for the logics.

Three distinctly different interpretations of Aristotle’s notion of a sullogismos in Prior Analytics can be traced: (1) a valid or invalid premise-conclusion argument (2) a single, logically true conditional proposition and (3) a cogent argumentation or deduction. Remarkably the three interpretations hold similar notions about the logical relationships among the sullogismoi. This is most apparent in their conflating three processes that Aristotle especially distinguishes: completion (A4-6)reduction(A7) and analysis (A45). Interpretive problems result from not sufficiently recognizing Aristotle’s remarkable degree of metalogical (...) sophistication to distinguish logical syntax from semantics and, thus, also from not grasping him to refine the deduction system of his underlying logic. While it is obvious that Aristotle most often uses ‘sullogimos’ to denote a valid argument of a certain kind, we show that at Prior Analytics A4-6, 7, 45 Aristotle specifically treats a sullogismos as an elemental argument pattern having only valid instances and that such a pattern then serves as a rule of deduction in his syllogistic logic. By extracting Aristotle’s understanding of three proof-theoretic processes, this paper provides new insight into what Aristotle thinks reasoning syllogistically is and, moreover, it resolves three problems in the most recent interpretation that takes a sullogismos to be a deduction. (shrink)

Jonathan Lear has suggested that Aristotle attempts to demonstrate a proof-theoretic analogue of a compactness theorem in Posterior analyticsI, chs. 19?22. Aristotle argues in these chapters that there cannot be in finite series of predications of terms. Lear's analysis of Aristotle's arguments are shown to be based on confusions about the nature of infinite orderings. Three distinct confusions are identified. In final remarks, it is suggested that a compactness claim is irrelevant to the issues which motivate Aristotle's arguments.

This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or majority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of \. There are two widely used semantics for Most A are B: \ > C \) and \ > \dfrac{C}{2} \), where C denotes (...) the cardinality of a given finite set X. Although is more descriptive than, it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpretation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of \, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit. (shrink)

The aim of this paper is to provide a contribution to the natural logic program which explores logics in natural language. The paper offers two logics called \ \) and \ \) for dealing with inference involving simple sentences with transitive verbs and ditransitive verbs and quantified noun phrases in subject and object position. With this purpose, the relational logics are introduced and a model-theoretic proof of decidability for they are presented. In the present paper we develop algebraic semantics of (...) the logics using congruence theory. (shrink)

In his 1910 book On the principle of contradiction in Aristotle, Jan Łukasiewicz claims that syllogistic is independent of the principle of contradiction . He also argues that Aristotle would have defended such a thesis in the Posterior Analytics. In this paper, we first show that Łukasiewicz's arguments for these two claims have to be rejected. Then, we show that the thesis of the independence of assertoric syllogistic vis-à-vis PC is nevertheless true. For that purpose, we first establish that there (...) is no possibility to account for Aristotle's original views on syllogistic without using per impossibile deductions. At last, following an idea due to Smith 1983, we prove that there is a complete reconstruction of assertoric syllogistic using ecthesis instead of reductio ad absurdum. Contrary to what is claimed in Smith 1983, we show that Smith's system SE has to be improved for such a reconstruction. This results in an ecthetic system which is complete with respect to syllogistic arguments, not explosi.. (shrink)

First-order logic haslimitedexistential import: the universalized conditional ∀x[S(x) → P(x)] implies its corresponding existentialized conjunction ∃x[S(x) & P(x)] insome but not allcases. We prove theExistential-Import Equivalence:∀x[S(x) → P(x)] implies ∃x[S(x) & P(x)] iff ∃xS(x) is logically true.The antecedent S(x) of the universalized conditional alone determines whether the universalized conditionalhas existential import: implies its corresponding existentialized conjunction.Apredicateis a formula having onlyxfree. Anexistential-importpredicate Q(x) is one whose existentialization, ∃xQ(x), is logically true; otherwise, Q(x) isexistential-import-freeor simplyimport-free. Existential-import predicates are also said to beimport-carrying.How (...) widespread is existential import? How widespread are import-carrying predicates in themselves or in comparison to import-free predicates? To answer, let L be any first-order language with any interpretation INT in any [sc. nonempty] universe U. A subset S of U isdefinable inLunderINT iff for some predicate Q(x) in L, S is the truth-set of Q(x) under INT. S isimport-carrying definableiff S is the truth-set of an import-carrying predicate. S isimport-free definableiff S is the truth-set of an import-free predicate.Existential-Importance Theorem: Let L, INT, and U be arbitrary. Every nonempty definable subset of U isbothimport-carrying definableandimport-free definable.Import-carrying predicates are quite abundant, and no less so than import-free predicates. Existential-import implications hold as widely as they fail.A particular conclusion cannot be validly drawn from a universal premise, or from any number of universal premises.—Lewis-Langford, 1932, p. 62. (shrink)

Prior Analytics by the Greek philosopher Aristotle and Laws of Thought by the English mathematician George Boole are the two most important surviving original logical works from before the advent of modern logic. This article has a single goal: to compare Aristotle's system with the system that Boole constructed over twenty-two centuries later intending to extend and perfect what Aristotle had started. This comparison merits an article itself. Accordingly, this article does not discuss many other historically and philosophically important aspects (...) of Boole's book, e.g. his confused attempt to apply differential calculus to logic, his misguided effort to make his system of ‘class logic’ serve as a kind of ‘truth-functional logic’, his now almost forgotten foray into probability theory, or his blindness to the fact that a truth-functional combination of equations that follows from a given truth-functional combination of equations need not follow truth-functionally. One of the main conclusions is that Boole's contribution widened logic and changed its nature to such an extent that he fully deserves to share with Aristotle the status of being a founding figure in logic. By setting forth in clear and systematic fashion the basic methods for establishing validity and for establishing invalidity, Aristotle became the founder of logic as formal epistemology. By making the first unmistakable steps toward opening logic to the study of ‘laws of thought’—tautologies and laws such as excluded middle and non-contradiction—Boole became the founder of logic as formal ontology.… using mathematical methods … has led to more knowledge about logic in one century than had been obtained from the death of Aristotle up to … when Boole's masterpiece was published.Paul Rosenbloom 1950. (shrink)

The paper shows that in the Art of Thinking (The Port Royal Logic) Arnauld and Nicole introduce a new way to state the truth-conditions for categorical propositions. The definition uses two new ideas: the notion of distributive or, as they call it, universal term, which they abstract from distributive supposition in medieval logic, and their own version of what is now called a conservative quantifier in general quantification theory. Contrary to the interpretation of Jean-Claude Parienté and others, the truth-conditions do (...) not require the introduction of a new concept of ‘indefinite’ term restriction because the notion of conservative quantifier is formulated in terms of the standard notion of term intersection. The discussion shows the following. Distributive supposition could not be used in an analysis of truth because it is explained in terms of entailment, and entailment in terms of truth. By abstracting from semantic identities that underlie distribution, the new concept of distributive term is definitionally prior to truth and can, therefore, be used in a non-circular way to state truth-conditions. Using only standard restriction, the Logic’s truth-conditions for the categorical propositions are stated solely in terms of (1) universal (distributive) term, (2) conservative quantifier, and (3) affirmative and negative proposition. It is explained why the Cartesian notion of extension as a set of ideas is in this context equivalent to medieval and modern notions of extension. (shrink)

It has been said that there is no scholarly consensus as to why Aristotle’s logics of proof and refutation would have borne the title _Analytics._ But if we consulted Tarski’s (Introduction to logic and the methodology of deductive sciences, Oxford University Press, New York, 1941) graduate-level primer, we would have the perfect title for them: _Introduction to logic and to the methodology of deductive sciences._ There are two strings to Aristotle’s bow. The methodological string is the founding work on the (...) epistemology of science, and the logical string sets down conditions on the proofs that bring this knowledge about. The logic of proof presents a difficulty whose solution exceeds its theoretical reach. The logic of refutation takes the problem on board, and advances a solution whose execution is framed by fallacy-avoidance at the beginning and fallacy-adoption at the end. But with a difference: the avoidance-fallacies are of Aristotle’s own conception, whereas the adoption-fallacies, so judged in the modern tradition, aren’t fallacies at all for Aristotle. The avoidance-fallacies are begging the question and _ignoratio elenchi_, and the adoption-fallacies, fallacies in name only, are the _ad hominem_ and _ad ignorantiam_, an inductive turning in the first instance, and an abductive finish in the second. (shrink)

Infinite regress arguments are a powerful tool in Aristotle, but this style of argument has received relatively little attention. Improving our understanding of infinite regress arguments has become pressing since recent scholars have pointed out that it is not clear whether Aristotle’s infinite regress arguments are, in general, effective or indeed what the logical structure of these arguments is. One obvious approach would be to hold that Aristotle takes infinite regress arguments to be per impossibile arguments, which derive an infinite (...) sequence. Due to his finitism, Aristotle then rejects such a sequence as impossible. This paper argues that this obvious approach does not work, even for its most amenable cases. The paper argues instead that infinite regress arguments involve domain-specific infinities, and so there is not a general finitism which underpins infinite regress arguments in Aristotle, but rather domain-specific reasons that there cannot be an infinite number of entities in each domain in which Aristotle invokes an infinite regress argument. (shrink)

In 1902 there arrived in Jena a letter from Russell laying out a proof that shattered Frege’s confidence in logicism, which is widely taken to be the doctrine according to which every truth of arithmetic is re-expressible without relevant loss as a provable truth about a purely logical object. Frege was persuaded that Russell had exposed a pathology in logicism, which faced him with the task of examining its symptoms, diagnosing its cause, assessing its seriousness, arriving at a treatment option, (...) and making an estimate of future prospects. The symptom was the contradiction that had crept into naïve set theory in the form of the set that provably is and is not its own member. The diagnosis was that it is caused by Basic Law V of the Grundgesetze (Frege, In: Grundgesetze der Arithmetik: Begrifsschriftlich abgeleitet, Jena: Herman Pohle, 1893/1903. Translated into English as Basic Laws of Arithmetic, also edited by Philip A. Ebert and Marcus Rossberg, with Crispin Wright, Oxford: Oxford University Press, 2013). Triage answers the question, “How bad is it?” The answer was that the contradiction irreparably destroys the logicist project. The treatment option was nil. The disease was untreatable. In due course, the prognosis turned out to be that a scaled-down Fregean logic could have an honourable life as a theory inference for various domains of mathematical discourse, but not for domains containing the logical objects required for logicism. Since there aren’t such objects, there aren’t such domains. On the face of it, Frege’s logicist collapse is astonishing. Why wouldn’t he have repaired the fault in Law V and gone back to the business of bringing logicism to an assured realization? In the course of our reflections, we will have nice occasion to consider the good it might have done Frege to have booked some time with Aristotle had he been able to. By the time we’re finished, we’ll have cause to think that in the end the Russell might well have begged the question against Frege. (shrink)

We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.

In this work, attention is drawn to the abundant use of metaphor and analogy in works of logic. I argue that pervasiveness of figurative language is to be counted among the features that characterize logic and distinguish it from other sciences. This characteristic feature reflects the creativity that is inherent in logic and indeed has been demonstrated to be a necessary part of logic. The goal of this paper, in short, is to provide specific examples of figurative language used in (...) logic that yield insights into the nature of the subject. I encourage the reader to take metaphors seriously, and to accept that they are not mere embellishments but key elements in our understanding of logic. (shrink)

This paper undertakes a re-examination of Sir William Hamilton’s doctrine of the quantification of the predicate . Hamilton’s doctrine comprises two theses. First, the predicates of traditional syllogistic sentence-forms contain implicit existential quantifiers, so that, for example, All p is q is to be understood as All p is some q . Second, these implicit quantifiers can be meaningfully dualized to yield novel sentence-forms, such as, for example, All p is all q . Hamilton attempted to provide a deductive system (...) for his language, along the lines of the classical syllogisms. We show, using techniques unavailable to Hamilton, that such a system does exist, though with qualifications that distinguish it from its classical counterpart. (shrink)

In this article, the author attempts to explicate the notion of the best known Talmudic inference rule called qal wa-omer. He claims that this rule assumes a massive-parallel deduction, and for formalizing it, he builds up a case of massive-parallel proof theory, the proof-theoretic cellular automata, where he draws conclusions without using axioms.

This article is primarily concerned with Aristotle’s theory of the syllogistic, and the investigation of the hypothesis that logical symbolism and methodology were in these early stages of a geometrical nature; with the gradual algebraization that occurred historically being one of the main reasons that some of the earlier passages on logic may often appear enigmatic. The article begins with a brief introduction that underlines the importance of geometric thought in ancient Greek science, and continues with a short exposition of (...) Aristotle’s views and methods in regard to logic. We then offer an interpretation of syllogisms, as well as of the main proof methods that are utilized by Aristotle, in terms of diagrams that can be seen as analogous to those of Euclidean geometry; where the various proofs proceed by appropriately manipulating an initially drawn diagram, in a way parallel to constructions that occur in Euclid’s Elements. In this way, logic is presented as following, to a large degree, methodological tenets established by the practice of geometry. Finally, we present a diagrammatic decision procedure that allows one to directly read off the validity of syllogisms from a corresponding diagram, in a way such that no further manipulation of it is necessitated. (shrink)

Adopting a different method from the previous scholars, this article deduces the remaining 23 valid syllogisms just taking the syllogism AEE-4 as the basic axiom. The basic idea of this study is as follows: firstly, make full use of the trichotomy structure of categorical propositions to formalize categorical syllogisms. Then, taking advantage of the deductive rules in classical propositional logic and the basic facts in the generalized quantifier theory, we deduce the remaining 23 valid categorical syllogisms by taking just one (...) syllogism (that is, AEE-4) as the basic axiom. This article not only reveals the reducible relations between the syllogism AEE-4 and the other 23 valid syllogisms, but also establishes a concise formal axiomatic system for categorical syllogistic logic. We hope that the results and methods will provide a good mathematical paradigm for studying other kinds of syllogistic logics, and that the project will appeal to specialists in logic, linguistic semantics, computational semantics, cognitive science and artificial intelligence. (shrink)

Avec l’article « Aristotle’s natural deduction system », publié en 1974, J. Corcoran a contribué à diffuser une nouvelle perspective sur les écrits logiques d’Aristote et sur la théorie du syllogisme en particulier. Dans cet article, Corcoran affirme que, dans les premiers chapitres des Premiers Analytiques, Aristote ne propose pas un système axiomatique, qui supposerait une logique sous-jacente, ainsi que le pensait Łukasiewicz, mais plutôt un système de déduction naturelle, avec des dimensions métalogiques. Notre propos est ici basé sur une (...) courte monographie de Kurt Ebbinghaus, intitulée Ein formales Model der Syllogistik des Aristoteles (1964), où est fixé le canon de cette nouvelle perspective mentionnée plus haut et qui a été développé dans le cadre conceptuel de la « logique opérative » de Paul Lorenzen. Ebbinghaus développe une reconstruction formelle montrant que l’approche d’Aristote relève de la « théorie de la preuve », non seulement pour ce qui concerne le système d’inférence sous-jacent, mais aussi pour ce qui concerne les éléments métalogiques. C’est notamment à travers ce dernier aspect que se manifeste une différence majeure par rapport à la reconstruction de Corcoran. Alors que celui-ci pose que le système d’inférence d’Aristote est enraciné dans une sémantique de théorie des modèles (élaborée par Corcoran lui-même), Ebbinghaus comprend que la théorie du syllogisme a été développée à partir d’une approche de la signification par des règles (« rule based »), semblables aux règles d’un jeu. En fait, la reconstruction d’Ebbinghaus offre une lecture pragmatiste de la syllogistique d’Aristote, qui, tel est notre propos, paraît non seulement beaucoup plus proche du point de vue d’Aristote que ne l’est la sémantique de théorie des modèles proposée par Corcoran, mais qui, de plus, permet de saisir l’unité systématique de la théorie du syllogisme. (shrink)

Professor Girle suggests that the ancient Athenian interest in Aristotle’s syllogistic flowed from a preoccupation with debate in the form of a dialogue game. But other cultures, especially in India, also had a preoccupation with debate that could be characterized in the same way. This kind of explanation seems to us to ignore the elephant in the room: the fact that, in ancient Athens, dialogue and debate were not merely a game. They were the life and death of the state. (...) Many Athenians felt that foolish policies had cost the state dearly, especially during the Peloponnesian War, and many of them blamed those policies on shoddy political reasoning in the Assembly. (Plato hammers at this theme relentlessly.) And tellingly, it is only in the wake of such tragedies that Aristotle’s syllogistic finally emerged. We think that any credible explanation of the ancient Greek interest in formal logic needs to include this grim political reality. (shrink)

By considering the new notion of theinversesof syllogisms such asBarbaraandCelarent, we show how the rule ofIndirect Proof, in the form (no multiple or vacuous discharges) used by Aristotle, may be dispensed with, in a system comprising four basic rules of subalternation or conversion and six basic syllogisms.