I discuss in this paper the six requirements Aristotle advances at Posterior Analytics A-2, 71b20-33, for the premisses of a scientific demonstration. I argue that the six requirements give no support for an intepretation in terms of “axiomatization”. Quite on the contrary, the six requirements can be consistently understood in a very different picture, according to which the most basic feature of a scientific demonstration is to explain a given proposition by its appropriate cause.

I use the Corcoran–Smiley interpretation of Aristotle's syllogistic as my starting point for an examination of the syllogistic from the vantage point of modern proof theory. I aim to show that fresh logical insights are afforded by a proof-theoretically more systematic account of all four figures. First I regiment the syllogisms in the Gentzen–Prawitz system of natural deduction, using the universal and existential quantifiers of standard first-order logic, and the usual formalizations of Aristotle's sentence-forms. I explain how the syllogistic is (...) a fragment of my system of Core Logic. Then I introduce my main innovation: the use of binary quantifiers, governed by introduction and elimination rules. The syllogisms in all four figures are re-proved in the binary system, and are thereby revealed as all on a par with each other. I conclude with some comments and results about grammatical generativity, ecthesis, perfect validity, skeletal validity and Aristotle's chain principle. (shrink)

In this paper we provide an interpretation of Aristotle's rule for the universal quantifier in Topics Θ 157a34–37 and 160b1–6 in terms of Paul Lorenzen's dialogical logic. This is meant as a contribution to the rehabilitation of the role of dialectic within the Organon. After a review of earlier views of Aristotle on quantification, we argue that this rule is related to the dictum de omni in Prior Analytics A 24b28–29. This would be an indication of the dictum’s origin in (...) the context of dialectical games. One consequence of our approach is a novel explanation of the doctrine of the existential import of the quantifiers in dialectical terms. After a brief survey of Lorenzen's dialogical logic, we offer a set of rules for dialectical games based on previous work by Castelnérac and Marion, to which we add here the rule for the universal quantifier, as interpreted in terms of its counterpart in dialogical logic. We then give textual evidence of the use of that rule in Plato's dialogues, thus showing that Aris... (shrink)

Contrary to common misconceptions, today's logic is not devoid of existential import: the universalized conditional ∀ x [S→ P] implies its corresponding existentialized conjunction ∃ x [S & P], not in all cases, but in some. We characterize the proexamples by proving the Existential-Import Equivalence: The antecedent S of the universalized conditional alone determines whether the universalized conditional has existential import, i.e. whether it implies its corresponding existentialized conjunction.A predicate is an open formula having only x free. An existential-import predicate (...) Q is one whose existentialization, ∃ x Q, is logically true; otherwise, Q is existential-import-free or simply import-free.How abundant or widespread is existential import? How abundant or widespread are existential-import predicates in themselves or in comparison to import-free predicates? We show that existential-import predicates are quite abundant, and no less so than import-free predicates. Existential.. (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)

This article analyses the relationship between deduction and induction by focusing on Aristotle's knowledge acquisition processes. The deductive and inductive processes in Aristotelian science are analyzed in depth, and it is emphasized that these two processes are, in fact, interrelated. It is claimed that induction and deduction use logical inference but are not themselves an inference. The structure of inductive inference is determined, and the deductive inference and the inferential part of the scientific process are given. Furthermore, the article addresses (...) the reliability of the inductive process, emphasizing the difficulties in obtaining accurate results. In conclusion, it is shown that Aristotelian science has a fundamentally intuition-based part and plays an important role in the scientific process. (shrink)

This expository paper on Aristotle’s prototype underlying logic is intended for a broad audience that includes non-specialists. It requires as background a discussion of Aristotle’s demonstrative logic. Demonstrative logic or apodictics is the study of demonstration as opposed to persuasion. It is the subject of Aristotle’s two-volume Analytics, as its first sentence says. Many of Aristotle’s examples are geometrical. A typical geometrical demonstration requires a theorem that is to be demonstrated, known premises from which the theorem is to be deduced, (...) and a deductive logic by which the steps of the deduction proceed. Every demonstration produces knowledge of its conclusion for every person who comprehends the demonstration. Aristotle presented a general truth-and-consequence theory of demonstration meant to apply to all demonstrations: a demonstration is an extended argumentation that begins with premises known to be truths and that involves a chain of reasoning showing by deductively evident steps that its conclusion is a consequence of its premises. In short, a demonstration is a deduction whose premises are known to be true. Aristotle’s general theory of demonstration required a prior general theory of deduction presented in the Prior Analytics. His general immediate-deduction-chaining theory of deduction was meant to apply to all deductions: any deduction that is not immediately evident is an extended argumentation that involves a chaining of immediately evident steps that shows its final conclusion to follow logically from its premises. His deductions, both direct and indirect, were rule-based and not tautology-based. The idea of tautology-based deduction, which dominated modern logic in the early years of the 1900s, is nowhere to be found in Analytics. Rule-based deduction was rediscovered by modern logicians. To illustrate his general theory of deduction, Aristotle presented a prototype: an ingeniously simple and mathematically precise special case traditionally known as the categorical syllogistic. With reference only to propositions of the four so-called categorical forms, he painstakingly worked out exactly what those immediately evident deductive steps are and how they are chained to complete deductions. In his specialized prototype theory, Aristotle explained how to deduce from a given categorical premise set, no matter how large, any categorical conclusion implied by the given set. He did not extend this treatment to non-categorical deductions, thus setting a program for future logicians. The prototype, categorical syllogistic, was seen by Boole as a “first approximation” to a comprehensive logic. Today, however it appears more as the first of the dozens of logics already created and as the first exemplification of a family that continues to expand. (shrink)

We are much better equipped to let the facts reveal themselves to us instead of blinding ourselves to them or stubbornly trying to force them into preconceived molds. We no longer embarrass ourselves in front of our students, for example, by insisting that “Some Xs are Y” means the same as “Some X is Y”, and lamely adding “for purposes of logic” whenever there is pushback. Logic teaching in this century can exploit the new spirit of objectivity, humility, clarity, observationalism, (...) contextualism, and pluralism. Besides the new spirit there have been quiet developments in logic and its history and philosophy that could radically improve logic teaching. This lecture expands points which apply equally well in first, second, and third courses, i.e. in “critical thinking”, “deductive logic”, and “symbolic logic”. (shrink)

-/- A schema (plural: schemata, or schemas), also known as a scheme (plural: schemes), is a linguistic template or pattern together with a rule for using it to specify a potentially infinite multitude of phrases, sentences, or arguments, which are called instances of the schema. Schemas are used in logic to specify rules of inference, in mathematics to describe theories with infinitely many axioms, and in semantics to give adequacy conditions for definitions of truth. -/- 1. What is a Schema? (...) 2. Uses of Schemas 3. The Ontological Status of Schemas 4. Schemas in the History of Logic Bibliography. (shrink)

Studies of Aristotle’s syllogistic system, since Corcoran’s deductionist interpretation supplanted Łukasiewicz’ axiomaticist interpretation, misrepresent Aristotle’s logic in two important respects. Following Corcoran, they take indirect deduction to occur only once in a deduction discourse; they then obviate the system having a reductio rule. Second, they represent reduction as a deductive process for deriving ‘imperfect’ syllogisms from ‘perfect’ syllogisms to impose an axiomatic interpretation on the logic. Denying that Aristotle's logic admits of a reductio rule results from this misrepresentation of reduction. (...) This discussion shows that the defects imputed to Aristotle's logic, and systems devised to resolve them, result from misunderstanding reduction, which itself results from misapprehending Prior Analytics expressly to identify in a metadiscourse deduction rules and not deductions per se. (shrink)

This essay addresses the collapse/incoherence problem for normative frameworks that contain both fundamental values and rules for promoting those values. The problem is that in some cases, we would bring about more of the fundamental value by violating the framework’s rules than by following them. In such cases, if the framework requires us to follow the rules anyway, then it appears to be incoherent; but if it allows us to make exceptions to the rules, then the framework “collapses” into one (...) that doesn’t make use of rules in the first place. The chapter begins with an examination of happiness and truth as fundamental values in Mill’s work, which lead into parallel versions of the collapse/incoherence problem in ethics and epistemology. It then sets out the collapse problem for rule-consequentialist approaches in ethics, truth-directed accounts of justification in epistemology, and epistemological approaches to argument cogency. The chapter closes with discussion of two potential solutions to the problem. (shrink)

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)

I argue that, in the Prior Analytics, higher and above the well-known ‘reduction through impossibility’ of figures, Aristotle is resorting to a general procedure of demonstrating through impossibility in various contexts. This is shown from the analysis of the role of adunaton in conversions of premises and other demonstrations where modal or truth-value consistency is indirectly shown to be valid through impossibility. Following the meaning of impossible as ‘non-existent’, the system is also completed by rejecting any invalid combinations of terms (...) in deductions or conversions. The notion of impossibility reaches the core of Aristotle's system in the Prior Analytics. On the one hand, the use of adunaton shows that he is following one of the two requisites for demonstrative science formulated in the Posterior Analytics, i.e. to demonstrate that it is impossible for things to be otherwise than stated. On the other hand, that demonstrations through impossibility are rooted in the notion of contradiction supp.. (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)

Hypersequents are a natural generalization of ordinary sequents which turn out to be a very suitable tool for presenting cut-free Gentzent-type formulations for diverse logics. In this paper, an alternative way of formulating hypersequent calculi (by introducing meta-variables for formulas, sequents and hypersequents in the object language) is presented. A suitable category of hypersequent calculi with their morphisms is defined and both types of fibring (constrained and unconstrained) are introduced. The introduced morphisms induce a novel notion of translation between logics (...) which preserves metaproperties in a strong sense. Finally, some preservation features are explored. (shrink)