John Corcoran

(1937 - 2021)

Since the time of Aristotle's students, interpreters have considered Prior Analytics to be a treatise about deductive reasoning, more generally, about methods of determining the validity and invalidity of premise-conclusion arguments. People studied Prior Analytics in order to learn more about deductive reasoning and to improve their own reasoning skills. These interpreters understood Aristotle to be focusing on two epistemic processes: first, the process of establishing knowledge that a conclusion follows necessarily from a set of premises (that is, on the epistemic process of extracting information implicit in explicitly given information) and, second, the process of establishing knowledge that a conclusion does not follow. Despite the overwhelming tendency to interpret the syllogistic as formal epistemology, it was not until the early 1970s that it occurred to anyone to think that Aristotle may have developed a theory of deductive reasoning with a well worked-out system of deductions comparable in rigor and precision with systems such as propositional logic or equational logic familiar from mathematical logic. When modern logicians in the 1920s and 1930s first turned their attention to the problem of understanding Aristotle's contribution to logic in modern terms, they were guided both by the Frege-Russell conception of logic as formal ontology and at the same time by a desire to protect Aristotle from possible charges of psychologism. They thought they saw Aristotle applying the informal axiomatic method to formal ontology, not as making the first steps into formal epistemology. They did not notice Aristotle's description of deductive reasoning. Ironically, the formal axiomatic method (in which one explicitly presents not merely the substantive axioms but also the deductive processes used to derive theorems from the axioms) is incipient in Aristotle's presentation. Partly in opposition to the axiomatic, ontically-oriented approach to Aristotle's logic and partly as a result of attempting to increase the degree of fit between interpretation and text, logicians in the 1970s working independently came to remarkably similar conclusions to the effect that Aristotle indeed had produced the first system of formal deductions. They concluded that Aristotle had analyzed the process of deduction and that his achievement included a semantically complete system of natural deductions including both direct and indirect deductions. Where the interpretations of the 1920s and 1930s attribute to Aristotle a system of propositions organized deductively, the interpretations of the 1970s attribute to Aristotle a system of deductions, or extended deductive discourses, organized epistemically. The logicians of the 1920s and 1930s take Aristotle to be deducing laws of logic from axiomatic origins; the logicians of the 1970s take Aristotle to be describing the process of deduction and in particular to be describing deductions themselves, both those deductions that are proofs based on axiomatic premises and those deductions that, though deductively cogent, do not establish the truth of the conclusion but only that the conclusion is implied by the premise-set. Thus, two very different and opposed interpretations had emerged, interestingly both products of modern logicians equipped with the theoretical apparatus of mathematical logic. The issue at stake between these two interpretations is the historical question of Aristotle's place in the history of logic and of his orientation in philosophy of logic. This paper affirms Aristotle's place as the founder of logic taken as formal epistemology, including the study of deductive reasoning. A by-product of this study of Aristotle's accomplishments in logic is a clarification of a distinction implicit in discourses among logicians--that between logic as formal ontology and logic as formal epistemology.

Equality and identity. Bulletin of Symbolic Logic. 19 (2013) 255-6. (Coauthor: Anthony Ramnauth) Also see https://www.academia.edu/s/a6bf02aaab This article uses ‘equals’ [‘is equal to’] and ‘is’ [‘is identical to’, ‘is one and the same as’] as they are used in ordinary exact English. In a logically perfect language the oxymoron ‘the numbers 3 and 2+1 are the same number’ could not be said. Likewise, ‘the number 3 and the number 2+1 are one number’ is just as bad from a logical point of view. In normal English these two sentences are idiomatically taken to express the true proposition that ‘the number 3 is the number 2+1’. Another idiomatic convention that interferes with clarity about equality and identity occurs in discussion of numbers: it is usual to write ‘3 equals 2+1’ when “3 is 2+1” is meant. When ‘3 equals 2+1’ is written there is a suggestion that 3 is not exactly the same number as 2+1 but that they merely have the same value. This becomes clear when we say that two of the sides of a triangle are equal if the two angles they subtend are equal or have the same measure. Acknowledgements: Robert Barnes, Mark Brown, Jack Foran, Ivor Grattan-Guinness, Forest Hansen, David Hitchcock, Spaulding Hoffman, Calvin Jongsma, Justin Legault, Joaquin Miller, Tania Miller, and Wyman Park. ► JOHN CORCORAN AND ANTHONY RAMNAUTH, Equality and identity. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: [email protected] The two halves of one line are equal but not identical [one and the same]. Otherwise the line would have only one half! Every line equals infinitely many other lines, but no line is [identical to] any other line—taking ‘identical’ strictly here and below. Knowing that two lines equaling a third are equal is useful; the condition “two lines equaling a third” often holds. In fact any two sides of an equilateral triangle is equal to the remaining side! But could knowing that two lines being [identical to] a third are identical be useful? The antecedent condition “two things identical to a third” never holds, nor does the consequent condition “two things being identical”. If two things were identical to a third, they would be the third and thus not be two things but only one. The plural predicate ‘are equal’ as in ‘All diameters of a given circle are equal’ is useful and natural. ‘Are identical’ as in ‘All centers of a given circle are identical’ is awkward or worse; it suggests that a circle has multiple centers. Substituting equals for equals [replacing one of two equals by the other] makes sense. Substituting identicals for identicals is empty—a thing is identical only to itself; substituting one thing for itself leaves that thing alone, does nothing. There are as many types of equality as magnitudes: angles, lines, planes, solids, times, etc. Each admits unit magnitudes. And each such equality analyzes as identity of magnitude: two lines are equal [in length] if the one’s length is identical to the other’s. Tarski [1] hardly mentioned equality-identity distinctions (pp. 54-63). His discussion begins: Among the logical concepts […], the concept of IDENTITY or EQUALITY […] has the greatest importance. Not until page 62 is there an equality-identity distinction. His only “notion of equality”, if such it is, is geometrical congruence—having the same size and shape—an equivalence relation not admitting any unit. Does anyone but Tarski ever say ‘this triangle is equal to that’ to mean that the first is congruent to that? What would motivate him to say such a thing? This lecture treats the history and philosophy of equality-identity distinctions. [1] ALFRED TARSKI, Introduction to Logic, Dover, New York, 1995. [This is expanded from the printed abstract.]

JOHN CORCORAN AND WILIAM FRANK. Surprises in logic. Bulletin of Symbolic Logic. 19 253. Some people, not just beginning students, are at first surprised to learn that the proposition “If zero is odd, then zero is not odd” is not self-contradictory. Some people are surprised to find out that there are logically equivalent false universal propositions that have no counterexamples in common, i. e., that no counterexample for one is a counterexample for the other. Some people would be surprised to find out that in normal first-order logic existential import is quite common: some universals “Everything that is S is P” —actually quite a few—imply their corresponding existentials “Something that is S is P”. Anyway, perhaps contrary to its title, this paper is not a cataloging of surprises in logic but rather about the mistakes that did or might have or might still lead people to think that there are no surprises in logic. The paper cataloging of surprises in logic is on our “to-do” list. -/- ► JOHN CORCORAN AND WILIAM FRANK, Surprises in logic. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: [email protected] There are many surprises in logic. Peirce gave us a few. Russell gave Frege one. Löwenheim gave Zermelo one. Gödel gave some to Hilbert. Tarski gave us several. When we get a surprise, we are often delighted, puzzled, or skeptical. Sometimes we feel or say “Nice!”, “Wow, I didn’t know that!”, “Is that so?”, or the like. Every surprise belongs to someone. There are no disembodied surprises. Saying there are surprises in logic means that logicians experience surprises doing logic—not that among logical propositions some are intrinsically or objectively “surprising”. The expression “That isn’t surprising” often denigrates logical results. Logicians often aim for surprises. In fact, [1] argues that logic’s potential for surprises helps motivate its study and, indeed, helps justify logic’s existence as a discipline. Besides big surprises that change logicians’ perspectives, the logician’s daily life brings little surprises, e.g. that Gödel’s induction axiom alone implies Robinson’s axiom. Sometimes wild guesses succeed. Sometimes promising ideas fail. Perhaps one of the least surprising things about logic is that it is full of surprises. Against the above is Wittgenstein’s surprising conclusion : “Hence there can never be surprises in logic”. This paper unearths basic mistakes in [2] that might help to explain how Wittgenstein arrived at his false conclusion and why he never caught it. The mistakes include: unawareness that surprise is personal, confusing logicians having certainty with propositions having logical necessity, confusing definitions with criteria, and thinking that facts demonstrate truths. People demonstrate truths using their deductive know-how and their knowledge of facts: facts per se are epistemically inert. [1] JOHN CORCORAN, Hidden consequence and hidden independence. This Bulletin, vol.16, p. 443. [2] LUDWIG WITTGENSTEIN, Tractatus Logico-Philosophicus, Kegan Paul, London, 1921. -/-.

Following Quine [] and others we take deductions to produce knowledge of implications: a person gains knowledge that a given premise-set implies a given conclusion by deducing—producing a deduction of—the conclusion from those premises. How does this happen? How does a person recognize their desire for that knowledge of a certain implication, or that they lack it? How do they produce a suitable deduction? And most importantly, how does their production of that deduction provide them with knowledge of the implication. What experienceable sign reveals to the reasoner that they achieved the desired knowledge? If a deduction is an array of inscriptions constructed by following syntactical—mechanical, machine-performable—rules as suggested by Tarski, Carnap, Church, and others, the epistemic question becomes even more pressing and more challenging. Moreover, deduction, the ability to produce deductions and to recognize them when produced, is operational knowledge that presupposes other component operations such as recognizing characters, making assumptions, inferring conclusions from premises, chaining inferences [AL].

It is widely agreed by philosophers that the so-called “Frege-Russell definition of natural number” is actually an assertion concerning the nature of the numbers and that it cannot be regarded as a definition in the ordinary mathematical sense. On the basis of the reasoning in this paper it is clear that the Frege-Russell definition contradicts the following three principles (taken together): (1) each number is the same entity in each possible world, (2) each number exists in each possible world, (3) some entities existing in the actual world do not exist in every possible world. Since these principles seem to be true, the paper is a refutation of the Frege-Russell definition. The paper does more. It shows that the contradictory of the Frege-Russell definition follows even when principles 2 and 3 are replaced by one considerably weaker principle. The ideas contained in the paper are related to two earlier objections to the definition. The first, sometimes attributed to the mathematician, C. S. Keyser, is that existence of the numbers as defined implies the existence of infinitely many particulars in each possible world. The second is, in effect, an idea which is said to have led Whitehead to reject the definition of number to which he had subscribed in Principia Mathematica. Whitehead is supposed to have said that he could not believe that the number two changes every “time twins are born”. The mathematician H. Jeffreys expressed similar ideas [Philos. of Sci. 5 (1938), 434–451]. One of the merits of the author’s work is that it refutes the Frege-Russell definition without the need to take sides on controversial points presupposed by the Keyser and Whitehead objections. The objections made by the author are therefore not to be identified with the Keyser and Whitehead objections. Even if the author’s work is to be regarded as a refinement and integration of previous ideas, it is nevertheless a contribution—not only because the basic points are well worth repeating but also because the refinements are logically significant improvements and because the author has stated them clearly and concisely in the idiom of contemporary philosophy.

This 4-page review-essay—which is entirely reportorial and philosophically neutral as are my other contributions to MATHEMATICAL REVIEWS—starts with a short introduction to the philosophy known as mathematical structuralism. The history of structuralism traces back to George Boole (1815–1864). By reference to a recent article various feature of structuralism are discussed with special attention to ambiguity and other terminological issues. The review-essay includes a description of the recent article. The article’s 4-sentence summary is quoted in full and then analyzed. The point of the quotation is to make clear how murky, incompetent, and badly written the paper is. There is no way to determine from the article whether the editor or referees suggests improvements.

In this paper we prove the completeness of three logical systems I LI, IL2 and IL3. IL1 deals solely with identities {a = b), and its deductions are the direct deductions constructed with the three traditional rules: (T) from a = b and b = c infer a = c, (S) from a = b infer b = a and (A) infer a = a(from anything). IL2 deals solely with identities and inidentities {a ± b) and its deductions include both the direct and the indirect deductions constructed with the three traditional rules. IL3 is a hybrid of IL1 and IL2: its deductions are all direct as in IL1 but it deals with identities and inidentities as in IL2. IL1 and IL2 have a high degree of naturalness. Although the hybrid system IL3 was constructed as an artifact useful in the mathematical study of IL1 and IL2, it nevertheless has some intrinsically interesting aspects. The main motivation for describing and studying such simple systems is pedagogical. In teaching beginning logic one would like to present a system of logic which has the following properties. First, it exemplifies the main ideas of logic: implication, deduction, non-implication, counterargument(or countermodel), logical truth, self-contradiction, consistency,satisfiability, etc. Second, it exemplifies the usual general metaprinciples of logic: contraposition and transitivity of implication, cut laws, completeness,soundness, etc. Third, it is simple enough to be thoroughly grasped by beginners. Fourth, it is obvious enough so that its rules do not appear to be arbitrary or purely conventional. Fifth, it does not invite confusions which must be unlearned later. Sixth, it involves a minimum of presuppositions which are no longer accepted in mainstream contemporary logic.

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those involving the distinction between characterizing a system and axiomatizing the truths of a system.

Thirteen meanings of 'implication' are described and compared. Among them are relations that have been called: logical implication, material implication,deductive implication, formal implication, enthymemic implication, and factual implication. In a given context, implication is the homogeneous two-place relation expressed by the relation verb 'implies'. For heuristic and expository reasons this article skirts many crucial issues including use-mention, the nature of the entities that imply and are implied, and the processes by which knowledge of these relations are achieved. This paper is better thought of as an early stage of a dialogue than as a definitive treatise.

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC.

In the present article we attempt to show that Aristotle's syllogistic is an underlying logiC which includes a natural deductive system and that it isn't an axiomatic theory as had previously been thought. We construct a mathematical model which reflects certain structural aspects of Aristotle's logic. We examine the relation of the model to the system of logic envisaged in scattered parts of Prior and Posterior Analytics. Our interpretation restores Aristotle's reputation as a logician of consummate imagination and skill. Several attributions of shortcomings and logical errors to Aristotle are shown to be without merit. Aristotle's logic is found to be self-sufficient in several senses: his theory of deduction is logically sound in every detail. (His indirect deductions have been criticized, but incorrectly on our account.) Aristotle's logic presupposes no other logical concepts, not even those of propositional logic. The Aristotelian system is seen to be complete in the sense that every valid argument expressible in his system admits of a deduction within his deductive system: every semantically valid argument is deducible.

Argumentations are at the heart of the deductive and the hypothetico-deductive methods, which are involved in attempts to reduce currently open problems to problems already solved. These two methods span the entire spectrum of problem-oriented reasoning from the simplest and most practical to the most complex and most theoretical, thereby uniting all objective thought whether ancient or contemporary, whether humanistic or scientific, whether normative or descriptive, whether concrete or abstract. Analysis, synthesis, evaluation, and function of argumentations are described. Perennial philosophic problems, epistemic and ontic, related to argumentations are put in perspective. So much of what has been regarded as logic is seen to be involved in the study of argumentations that logic may be usefully defined as the systematic study of argumentations, which is virtually identical to the quest of objective understanding of objectivity.

A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual.

Down through the ages, logic has adopted many strange and awkward technical terms: assertoric, prove, proof, model, constant, variable, particular, major, minor, and so on. But truth-value is a not a typical example. Every proposition, even if false, no matter how worthless, has a truth-value:even “one plus two equals four” and “one is not one”. In fact, every two false propositions have the same truth-value—no matter how different they might be, even if one is self-contradictory and one is consistent. It is not such a big surprise that every true proposition, no matter how worthless, has a truth-value. Every proposition, whether valuable or worthless, has a truth-value.But it is a little strange that every two true propositions, no matter how different they might be, have the same truth-value. The Pythagorean Theorem has the same truth-value as the proposition that one is one. It is a stretch to think of truth-values as values in any of the normal senses of the word ‘value’.

Demonstrative logic, the study of demonstration as opposed to persuasion, is the subject of Aristotle's two-volume Analytics. Many examples are geometrical. Demonstration produces knowledge (of the truth of propositions). Persuasion merely produces opinion. Aristotle presented a general truth-and-consequence conception of demonstration meant to apply to all demonstrations. According to him, a demonstration, which normally proves a conclusion not previously known to be true, is an extended argumentation beginning with premises known to be truths and containing a chain of reasoning showing by deductively evident steps that its conclusion is a consequence of its premises. In particular, 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 conception of deduction was meant to apply to all deductions. According to him, any deduction that is not immediately evident is an extended argumentation that involves a chaining of intermediate immediately evident steps that shows its final conclusion to follow logically from its premises. To illustrate his general theory of deduction, he presented an ingeniously simple and mathematically precise special case traditionally known as the categorical syllogistic.

An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and it develops algorithmic methods for certain classes of such problems. The results are then applied to classical number theory, in particular, to questions concerning possible refinements of the 1931 Gödel Axiom Set, e.g. whether any of its axioms can be analyzed into “informational atoms”. Two propositions are “informationally unconnected” [with each other] if no informative (nontautological) consequence of one also follows from the other. A proposition is an “informational atom” if it is informative but no information can be dropped from it without rendering it uninformative (tautological). Presentation, employment, and investigation of these two new concepts are prominent features of this paper.

Iffication, Preiffication, Qualiffication, Reiffication, and Deiffication. Roughly, iffication is the speech-act in which—by appending a suitable if-clause—the speaker qualifies a previous statement. The clause following if is called the qualiffication. In many cases, the intention is to retract part of the previous statement—called the preiffication. I can retract part of “I will buy three” by appending “if I have money”. This initial study focuses on logical relations among propositional contents of speech-acts—not their full conversational implicatures, which will be treated elsewhere. The modified statement—called the iffication—is never stronger than the preiffication. A degenerate iffication is one logically equivalent to its preiffication. There are limiting cases of degenerate iffications. In one, the qualiffication is tautological, as “I will buy three if three is three”. In another, the negation of the qualiffication implies the preiffication, as “I will buy three if I will not buy three”. Reiffication is iffication of an iffication. “I will buy three if I have money” is reifficated by appending “if there are three left”. Deiffication is the speech-act in which—by appending a suitable and-clause—the effect of an iffication is cancelled so that the result implies the preiffication. “I will buy three if I have money” is deifficated by appending “and I have money”. All further examples come from standard (one-sorted, tenseless, non-modal) first-order arithmetic. All theorems are about first-order arithmetic propositions. An easy theorem, hinted above, is that an iffication is degenerate if and only if the negation of the qualiffication implies the preiffication. The iffication of a conjunction using one of the conjuncts as qualiffication need not imply the other conjunct: “Two is an even square if two is square” does not imply “Two is even”. END OF PRINTED ABSTRACT. Some find that the last statement provides a surprise in logic. https://www.academia.edu/s/a5a4386b75?source=link Acknowledgements: Robert Barnes, William Frank, Amanda Hicks, David Hitchcock, Leonard Jacuzzo, Edward Keenan, Mary Mulhern, Frango Nabrasa, and Roberto Torretti.

This presentation includes a complete bibliography of John Corcoran’s publications relevant on Aristotle’s logic. The Sections I, II, III, and IV list respectively 23 articles, 44 abstracts, 3 books, and 11 reviews. Section I starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article—from Corcoran’s Philadelphia period that antedates his discovery of Aristotle’s natural deduction system—and the Journal of Symbolic Logic article—from his Buffalo period first reporting his original results. It ends with works published in 2015. Some items are annotated as listed or with endnotes connecting them with other work and pointing out passages that, in retrospect, are seen to be misleading and in a few places erroneous. In addition, Section V, “Discussions”, is a nearly complete secondary bibliography of works describing, interpreting, extending, improving, supporting, and criticizing Corcoran’s work: 10 items published in the 1970s, 24 in the 1980s, 42 in the 1990s, 60 in the 2000s, and 70 in the current decade. The secondary bibliography is also annotated as listed or with endnotes: some simply quoting from the cited item, but several answering criticisms and identifying errors. Section VI, “Alternatives”, lists recent works on Aristotle’s logic oblivious of Corcoran’s research and, more generally in some cases, even of the Łukasiewicz-initiated tradition. As is evident from Section VII, “Acknowledgements”, Corcoran’s publications benefited from consultation with other scholars, most notably George Boger, Charles Kahn, John Mulhern, Mary Mulhern, Anthony Preus, Timothy Smiley, Michael Scanlan, Roberto Torretti, and Kevin Tracy. All of Corcoran’s Greek translations were done in collaboration with two or more classicists. Corcoran never published a sentence without discussing it with his colleagues and students.

ABSTRACT This part of the series has a dual purpose. In the first place we will discuss two kinds of theories of proof. The first kind will be called a theory of linear proof. The second has been called a theory of suppositional proof. The term "natural deduction" has often and correctly been used to refer to the second kind of theory, but I shall not do so here because many of the theories so-called are not of the second kind--they must be thought of either as disguised linear theories or theories of a third kind (see postscript below). The second purpose of this part is 25 to develop some of the main ideas needed in constructing a comprehensive theory of proof. The reason for choosing the linear and suppositional theories for this purpose is because the linear theory includes only rules of a very simple nature, and the suppositional theory can be seen as the result of making the linear theory more comprehensive. CORRECTION: At the time these articles were written the word ‘proof’ especially in the phrase ‘proof from hypotheses’ was widely used to refer to what were earlier and are now called deductions. I ask your forgiveness. I have forgiven Church and Henkin who misled me.

This book is best regarded as a concise essay developing the personal views of a major philosopher of logic and as such it is to be welcomed by scholars in the field. It is not (and does not purport to be) a treatment of a significant portion of those philosophical problems generally thought to be germane to logic. It would be easy to list many popular topics in philosophy of logic which it does not mention. Even its "definition" of logic-"the systematic study of logical truth"-is peculiar to the author and would be regarded as inappropriately restrictive by many logicians There are several standard ways of defining truth using sequences. Quine’s discussions in the 1970 first printing of Philosophy of logic and in previous lectures were vitiated by mixing two. Quine’s logical Two-Method Error, which eluded Quine’s colleagues, was corrected in the 1978 sixth printing. But Quine never explicitly acknowledged, described, or even mentioned the error in print although in correspondence he did thank Corcoran for bringing it to his attention. In regard to style one may note that the book is rich in metaphorical and sometimes even cryptic passages one of the more remarkable of which occurs in the Preface and seems to imply that deductive logic does not warrant distinctive philosophical treatment. Moreover, the author's sesquipedalian performances sometimes subvert perspicuity.

One innovation in this paper is its identification, analysis, and description of a troubling ambiguity in the word ‘argument’. In one sense ‘argument’ denotes a premise-conclusion argument: a two-part system composed of a set of sentences—the premises—and a single sentence—the conclusion. In another sense it denotes a premise-conclusion-mediation argument—later called an argumentation: a three-part system composed of a set of sentences—the premises—a single sentence—the conclusion—and complex of sentences—the mediation. The latter is often intended to show that the conclusion follows from the premises. The complementarity and interrelation of premise-conclusion arguments and premise-conclusion-mediation arguments resonate throughout the rest of the paper which articulates the conceptual structure found in logic from Aristotle to Tarski. This 1972 paper can be seen as anticipating Corcoran’s signature work: the more widely read 1989 paper, Argumentations and Logic, Argumentation 3, 17–43. MR91b:03006. The 1972 paper was translated into Portuguese. The 1989 paper was translated into Spanish, Portuguese, and Persian.

This self-contained lecture examines uses and misuses of the adverb conversely with special attention to logic and logic-related fields. Sometimes adding conversely after a conjunction such as and signals redundantly that a converse of what preceded will follow. (1) Tarski read Church and, conversely, Church read Tarski. In such cases, conversely serves as an extrapropositional constituent of the sentence in which it occurs: deleting conversely doesn’t change the proposition expressed. Nevertheless it does introduce new implicatures: a speaker would implicate belief that the second sentence expresses a converse of what the first expresses. Perhaps because such usage is familiar, the word conversely can be used as “sentential pronoun”—or prosentence—representing a sentence expressing a converse of what the preceding sentence expresses. (2) Tarski read Church and conversely. This would be understood as expressing the proposition expressed by (1). Prosentential usage introduces ambiguity when the initial proposition has more than one converse. Confusion can occur if the initial proposition has non-equivalent converses. Every proposition that is the negation of a false proposition is true and conversely. One sense implies that every proposition that is the negation of a true proposition is false, which is true of course. But another sense, probably more likely, implies that every proposition that is true is the negation of a false proposition, which is false: the proposition that one precedes two is not a negation and thus is not the negation of a false proposition. The above also applies to synonyms of conversely such as vice versa. Although prosentence has no synonym, extrapropositional constituents are sometimes called redundant rhetoric, filler, or expletive. Authors discussed include Aristotle, Boole, De Morgan, Peirce, Frege, Russell, Tarski, and Church. END OF PUBLISHED ABSTRACT See also: Corcoran, John. 2015. Converses, inner and outer. 2015. Cambridge Dictionary of Philosophy, third edition, Robert Audi (editor). Cambridge: Cambridge UP. https://www.academia.edu/10396347/Corcoran_s_27_entries_in_the_1999_second_edition_Audi_s_Cambridge_Dictionary_of_Philosophy.