John Corcoran

(1937 - 2021)

Putnam, Hilary FPhilosophy of logic. Harper Essays in Philosophy. Harper Torchbooks, No. TB 1544. Harper & Row, Publishers, New York-London, 1971. v+76 pp. The author of this book has made highly regarded contributions to mathematics, to philosophy of logic and to philosophy of science, and in this book he brings his ideas in these three areas to bear on the traditional philosophic problem of materialism versus (objective) idealism. The book assumes that contemporary science (mathematical and physical) is largely correct as far as it goes, or at least that it is rational to believe in it. The main thesis of the book is that consistent acceptance of contemporary science requires the acceptance of some sort of Platonistic idealism affirming the existence of abstract, non-temporal, non-material, non-mental entities (numbers,scientific laws, mathematical formulas, etc.). The author is thus in direct opposition to the extreme materialism which had dominated philosophy of science in the first three quarters of this century. the book can be especially recommended to the scientifically literate, general reader whose acquaintance with these areas is limited to the earlier literature of when it had been assumed that empiricistic materialism was the only philosophy compatible with a scientific outlook. To this group the book presents an eye-opening challenge fulfilling the author’s intention of “shaking up preconceptions and stimulating further discussion”.

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.

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.

A Inseparabilidade entre Lógica e a Ética. Philósophos. 18 (2013) 245–259. Portuguese translation by Décio Krause and Pedro Merlussi: The Inseparability of Logic and Ethics, Free Inquiry, Spring 1989, 37–40. This essay takes logic and ethics in broad senses: logic as the science of evidence; ethics as the science of justice. One of its main conclusions is that neither science can be fruitfully pursued without the virtues fostered by the other: logic is pointless without fairness and compassion; ethics is pointless without rigor and objectivity. The logician’s advice to be dispassionate is in resonance and harmony with the ethicist’s advice to be compassionate.

This exposition of ockham's theory of (common, Personal) supposition involves the logical form of the four descent/ascent conditions and the logical relations of these with the three main modes of supposition. Central theses: each condition is a one-Way entailment, Each mode is a truth-Functional combination of conditions, Two of the three modes are not even coextensive with the two-Way entailments commonly taken as their definitions. Ockham's idea of "the singulars" of a general proposition is vague and problematic and the entailment used in the descent/ascent conditions probably cannot be taken to be logical consequence in any strict sense

Corcoran, John. 2005. Meanings of word: type-occurrence-token. Bulletin of Symbolic Logic 11(2005) 117. -/- Once we are aware of the various senses of ‘word’, we realize that self-referential statements use ambiguous sentences. If a statement is made using the sentence ‘this is a pronoun’, is the speaker referring to an interpreted string, a string-type, a string-occurrence, a string-token, or what? The listeners can wonder “this what?”. -/- John Corcoran, Meanings of word: type-occurrence-token Philosophy, University at Buffalo, Buffalo, NY 14260-4150 E-mail: [email protected] The four-letter written-English expression ‘word’, which plays important roles in applications and expositions of logic and philosophy of logic, is ambiguous (multisense, or polysemic) in that it has multiple normal meanings (senses, or definitions). Several of its meanings are vague (imprecise, or indefinite) in that they admit of borderline (marginal, or fringe) cases. This paper juxtaposes, distinguishes, and analyses several senses of ‘word’ focusing on a constellation of senses analogous to constellations of senses of other expression words such as ‘expression’, ‘symbol’, ‘character’, ‘letter’, ‘term’, ‘phrase’, ‘formula’, ‘sentence’, ‘derivation’, ‘paragraph’, and ‘discourse’. Consider, e.g., the word ‘letter’. In one sense there are exactly twenty-six letters (letter-types or ideal letters) in the English alphabet and there are exactly four letters in the word ‘letter’. In another sense, there are exactly six letters (letter-repetitions or letter-occurrences) in the word-type ‘letter’. In yet another sense, every new inscription (act of writing or printing) of ‘letter’ brings into existence six new letters (letter-tokens or ink-letters) and one new word that had not previously existed. The number of letter-occurrences (occurrences of a letter-type) in a given word-type is the same as the number of letter-tokens (tokens of a letter-type) in a single token of the given word. Many logicians fail to distinguish “token” from “occurrence” and a few actually confuse the two concepts. Epistemological and ontological problems concerning word-types, word-occurrences, and word-tokens are described in philosophically neutral terms. This paper presents a theoretical framework of concepts and principles concerning logicography, including use of English in logic. The framework is applied to analytical exposition and critical evaluation of classic passages in the works of philosophers and logicians including Boole, Peirce, Frege, Russell, Tarski, Church and Quine. This paper is intended as a philosophical sequel to Corcoran et al. “String Theory”, Journal of Symbolic Logic 39(1974) 625-637. https://www.academia.edu/s/cdfa6c854e?source=link -/- .

Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). 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 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 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, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa.

This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching!

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.

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.]

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.

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.

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. -/- KEY WORDS: hypothesis, theorem, argumentation, proof, deduction, premise-conclusion argument, valid, inference, implication, epistemic, ontic, cogent, fallacious, paradox, formal, validation.

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