John Corcoran

(1937 - 2021)

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.

John Corcoran. 1979 Review of Hintikka and Remes. The Method of Analysis (Reidel, 1974). Mathematical Reviews 58 3202 #21388. The “method of analysis” is a technique used by ancient Greek mathematicians (and perhaps by Descartes, Newton, and others) in connection with discovery of proofs of difficult theorems and in connection with discovery of constructions of elusive geometric figures. Although this method was originally applied in geometry, its later application to number played an important role in the early development of algebra [Jacob Klein, English translation, Greek mathematical thought and the origin of algebra, especially pp. 154–157, M.I.T. Press, Cambridge, Mass., 1968]. It is universally agreed that the method of analysis begins by “assuming the thing sought after” (e.g., in geometry, the truth of the proposition to be proved or the existence of the geometric figure to be constructed). Aside from this, little else can be taken for granted. There is disagreement concerning the “direction of analysis”, i.e. whether one is to seek implications of the assumption or whether one is to seek implicants of it. There is also disagreement concerning what is to be “anatomized” (analyzed), i.e., whether one analyzes mathematical objects (figures), mathematical propositions (the axioms, known theorems, and analytic assumption) or an imagined proof (of the analytic assumption from axioms and known theorems).

This presentation includes a complete bibliography of John Corcoran’s publications devoted at least in part to Aristotle’s logic. Sections I–IV list 20 articles, 43 abstracts, 3 books, and 10 reviews. It starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article that antedates Corcoran’s Aristotle’s studies and the Journal of Symbolic Logic article first reporting his original results; it ends with works published in 2015. A few of the items are annotated with endnotes connecting them with other work. In addition, Section V “Discussions” is a nearly complete secondary bibliography of works describing, interpreting, extending, improving, supporting, and criticizing Corcoran’s work: 8 items published in the 1970s, 22 in the 1980s, 39 in the 1990s, 56 in the 2000s, and 65 in the current decade. The secondary bibliography is annotated with endnotes: some simply quoting from the cited item, but several answering criticisms and identifying errors. As is evident from the Acknowledgements sections, all of Corcoran’s publications benefited from correspondence with other scholars, most notably Timothy Smiley, Michael Scanlan, and Kevin Tracy. All of Corcoran’s Greek translations were done in consultation with two or more classicists. Corcoran never published a sentence without discussing it with his colleagues and students. REQUEST: Please send errors, omissions, and suggestions. I am especially interested in citations made in non-English publications.

Contrary to dictionaries, a non sequitur isn’t “any statement that doesn’t follow logically from previous statements”. Otherwise, every opening statement would be a non sequitur: a non sequitur is a statement claimed to follow from previous statements but that doesn’t follow. If the sentence making a given statement doesn’t contain ‘thus’, ‘so’, ‘hence’, ‘therefore’, or something else indicating an implication claim, the statement isn’t a non sequitur in this sense. But this is only one of several senses of that expression, which, contrary to appearances, is a unitary common noun more properly written as one word: non-sequitur or nonsequitur. Above a nonsequitur was, roughly speaking, a conclusion of an invalid premise- conclusion argument, but not every such, only those that were stated to follow from premises that had been stated. Every informative proposition is the conclusion of an invalid argument. Anyway, nonsequiturs were not arguments. However, the expression ‘nonsequitur’ also means “invalid premise- conclusion argument”. It also means something like “fallacious reasoning” as in ‘Abe’s proof of the big-bang hypothesis is a nonsequitur’. The English noun is also used for an irrelevancy, an abrupt change of topic, or for any of many other expressions that are gratuitous, inappropriate, incongruous, or in some other way out of place. The English noun is derived from the Latin expression ‘non sequitur’, which is not a common noun but a sentence variously meaning “it isn’t in sequence ”, “it doesn’t follow”, “it is out of order”, etc. A statement that begins ‘in the second place’ is a nonsequitur if the previous sentence lacked implication of something like ‘in the first place’ or if it contained something similar to ‘in the third place’. In fact, a true implication claim can be a nonsequitur if there is no reason for making it. If Ben says ‘Hence, Abe swims and Abe swims’ in reply to Carl’s statement ‘Abe swims‘, then Ben may well be committing a nonsequitur. Many conversation stoppers are nonsequiturs. This lecture surveys and analyses a wide selection of uses of ‘nonsequitur’ in logic and logic-related literature. -/- END OF DRAFT 4 -/- NOTE 091215: When Rick Perry was discussing possible withdrawal from the race—unfortunately not the human race but the Republican race—a reporter reminded him that just last week Donald Trump predicted the Perry withdrawal. Perry interrupted with “A broken clock is right once a day”. -/- If you did not know Perry you might think his reply was a brilliant diversionary nonsequitur. If you know Perry you might think his reply was a stupid nonsequitur. -/- For the record, he did say ‘once a day’, not ‘twice a day’. BTW, my interjection ‘unfortunately not the human race but the Republican race’ was also a nonsequitur.

Reid, Constance. Hilbert (a Biography). Reviewed by Corcoran in Philosophy of Science 39 (1972), 106–08. Constance Reid was an insider of the Berkeley-Stanford logic circle. Her San Francisco home was in Ashbury Heights near the homes of logicians such as Dana Scott and John Corcoran. Her sister Julia Robinson was one of the top mathematical logicians of her generation, as was Julia’s husband Raphael Robinson for whom Robinson Arithmetic was named. Julia was a Tarski PhD and, in recognition of a distinguished career, was elected President of the American Mathematics Society. https://en.wikipedia.org/wiki/Julia_Robinson http://www.awm-math.org/noetherbrochure/Robinson82.html

JUNE 2015 UPDATE: A BIBLIOGRAPHY: JOHN CORCORAN’S PUBLICATIONS ON ARISTOTLE 1972–2015 By John Corcoran This presentation includes a complete bibliography of John Corcoran’s publications relevant to his research on Aristotle’s logic. Sections I, II, III, and IV list 21 articles, 44 abstracts, 3 books, and 11 reviews. It starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article from Corcoran’s Philadelphia period that antedates his Aristotle studies and the Journal of Symbolic Logic article from his Buffalo period first reporting his original results; it ends with works published in 2015. A few of the 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: 8 items published in the 1970s, 23 in the 1980s, 42 in the 1990s, 56 in the 2000s, and 69 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, of the Lukasiewicz-initiated tradition. As is evident from Section VII, “Acknowledgements”, Corcoran’s publications benefited from consultation with other scholars, most notably 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. REQUEST: Please send errors, omissions, and suggestions. I am especially interested in citations made in non-English publications. Also, let me know of passages I should comment on.

JOHN CORCORAN AND WAGNER SANZ, Disbelief Logic Complements Belief Logic. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 USA E-mail: [email protected] Filosofia, Universidade Federal de Goiás, Goiás, GO 74001-970 Brazil E-mail: [email protected] Consider two doxastic states belief and disbelief. Belief is taking a proposition to be true and disbelief taking it to be false. Judging also dichotomizes: accepting a proposition results in belief and rejecting in disbelief. Stating follows suit: asserting a proposition conveys belief and denying conveys disbelief. Traditional logic implicitly focused on logical relations and processes needed in expanding and organizing systems of beliefs. Deducing a conclusion from beliefs results in belief of the conclusion. Deduction presupposes consequence: one proposition is a consequence of a set of a propositions if the latter logically implies the former. The role of consequence depends on its being truth-preserving: every consequence of a set of truths is true. This paper, which builds on previous work by the second author, explores roles of logic in expanding and organizing systems of disbeliefs. Aducing a conclusion from disbeliefs results in disbelief of the conclusion. Aduction presupposes contrequence: one proposition is a contrequence of a set of propositions if the set of negations or contradictory opposites of the latter logically implies that of the former. The role of contrequence depends on its being falsity-preserving: every contrequence of a set of falsehoods is false. A system of aductions that includes, for every contrequence of a given set, an aduction of the contrequence from the set is said to be complete. Historical and philosophical discussion is illustrated and enriched by presenting complete systems of aductions constructed by the second author. One such, a natural aduction system for Aristotelian categorical propositions, is based on a natural deduction system attributed to Aristotle by the first author and others. ADDED NOTE: Wagner Sanz reconstructed Aristotle’s logic the way it would have been had Aristole focused on constructing “anti-sciences” instead of sciences: more generally, on systems of disbeliefs.

A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized for using that rule in attempting to show that arithmetic equations are consequences of definitions. A system of deductions is truth-preserving if each of its deductions having true premises has a true conclusion—and consequence-preserving if, for any given set of sentences, each deduction having premises that are consequences of that set has a conclusion that is a consequence of that set. Consequence-preserving amounts to: in each of its deductions the conclusion is a consequence of the premises. The same definitions apply to deduction rules considered as systems of deductions. Every consequence-preserving system is truth-preserving. It is not as well-known that the converse fails: not every truth-preserving system is consequence-preserving. Likewise for rules: not every truth-preserving rule is consequence-preserving. There are many famous examples. In ordinary first-order Peano-Arithmetic, the induction rule yields the conclusion ‘every number x is such that: x is zero or x is a successor’—which is not a consequence of the null set—from two tautological premises, which are consequences of the null set, of course. The arithmetic induction rule is truth-preserving but not consequence-preserving. Truth-preserving rules that are not consequence-preserving are non-logical or extra-logical rules. Such rules are unacceptable to persons espousing traditional truth-and-consequence conceptions of demonstration: a demonstration shows its conclusion is true by showing that its conclusion is a consequence of premises already known to be true. The 1965 Preface in Benson Mates (1972, vii) contains the first occurrence of truth-preservation fallacies in the book.

Critical thinking involves deliberate application of tests and standards to beliefs per se and to methods used to arrive at beliefs. Pedagogical license is authorization accorded to teachers permitting them to use otherwise illicit means in order to achieve pedagogical goals. Pedagogical license is thus analogous to poetic license or, more generally, to artistic license. Pedagogical license will be found to be pervasive in college teaching. This presentation suggests that critical thinking courses emphasize two topics: first, the nature and usefulness of critical thinking; second, the nature and pervasiveness of pedagogical license. Awareness of pedagogical license alerts the student to the need for critical thinking. Indoctrination is done to students; education is done by students.

Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. Matthew, Mark, Luke, and John wrote Greek.? Every evangelist wrote Greek. Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John.? Every evangelist wrote Greek. The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is logically equivalent to the set of four atomic propositions: “Matthew wrote Greek”, “Mark wrote Greek”, “Luke wrote Greek”, and “John wrote Greek”. The universe of discourse is the set of evangelists. We presuppose standard first-order logic. As many logic texts teach, the first of these two premise-conclusion arguments—sometimes called a complete enumerative induction— is invalid in the sense that its conclusion does not follow from its premises. To get a counterargument, replace ‘Matthew’, ‘Mark’, ‘Luke’, and ‘John’ by ‘two’,’four’, ‘six’ and ‘eight’; replace ‘wrote Greek’ by ‘are even’; and replace ‘evangelist’ by ‘number’. This replacement converts the first argument into one having true premises and false conclusion. But the same replacement performed on the second argument does no such thing: it converts the second premise into the falsehood “Every number is two, four, six, or eight”. As many logic texts teach, there is no replacement that converts the second argument into one with all true premises and false conclusion. The second is valid; its conclusion is deducible from its two premises using an instructive natural deduction. This paper “does the math” behind the above examples. The theorem could be stated informally: the above examples are typical.

For each positive n, two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories.