An Argument for Minimal Logic
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Classifying Material Implications Over Minimal Logic
Classifying Material Implications over Minimal Logic Hannes Diener and Maarten McKubre-Jordens March 28, 2018 Abstract The so-called paradoxes of material implication have motivated the development of many non- classical logics over the years [2–5, 11]. In this note, we investigate some of these paradoxes and classify them, over minimal logic. We provide proofs of equivalence and semantic models separating the paradoxes where appropriate. A number of equivalent groups arise, all of which collapse with unrestricted use of double negation elimination. Interestingly, the principle ex falso quodlibet, and several weaker principles, turn out to be distinguishable, giving perhaps supporting motivation for adopting minimal logic as the ambient logic for reasoning in the possible presence of inconsistency. Keywords: reverse mathematics; minimal logic; ex falso quodlibet; implication; paraconsistent logic; Peirce’s principle. 1 Introduction The project of constructive reverse mathematics [6] has given rise to a wide literature where various the- orems of mathematics and principles of logic have been classified over intuitionistic logic. What is less well-known is that the subtle difference that arises when the principle of explosion, ex falso quodlibet, is dropped from intuitionistic logic (thus giving (Johansson’s) minimal logic) enables the distinction of many more principles. The focus of the present paper are a range of principles known collectively (but not exhaustively) as the paradoxes of material implication; paradoxes because they illustrate that the usual interpretation of formal statements of the form “. → . .” as informal statements of the form “if. then. ” produces counter-intuitive results. Some of these principles were hinted at in [9]. Here we present a carefully worked-out chart, classifying a number of such principles over minimal logic. -
Mathematical Logic. Introduction. by Vilnis Detlovs And
1 Version released: May 24, 2017 Introduction to Mathematical Logic Hyper-textbook for students by Vilnis Detlovs, Dr. math., and Karlis Podnieks, Dr. math. University of Latvia This work is licensed under a Creative Commons License and is copyrighted © 2000-2017 by us, Vilnis Detlovs and Karlis Podnieks. Sections 1, 2, 3 of this book represent an extended translation of the corresponding chapters of the book: V. Detlovs, Elements of Mathematical Logic, Riga, University of Latvia, 1964, 252 pp. (in Latvian). With kind permission of Dr. Detlovs. Vilnis Detlovs. Memorial Page In preparation – forever (however, since 2000, used successfully in a real logic course for computer science students). This hyper-textbook contains links to: Wikipedia, the free encyclopedia; MacTutor History of Mathematics archive of the University of St Andrews; MathWorld of Wolfram Research. 2 Table of Contents References..........................................................................................................3 1. Introduction. What Is Logic, Really?.............................................................4 1.1. Total Formalization is Possible!..............................................................5 1.2. Predicate Languages.............................................................................10 1.3. Axioms of Logic: Minimal System, Constructive System and Classical System..........................................................................................................27 1.4. The Flavor of Proving Directly.............................................................40 -
Minimal Logic and Automated Proof Verification
Minimal Logic and Automated Proof Verification Louis Warren A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics Department of Mathematics and Statistics University of Canterbury New Zealand 2019 Abstract We implement natural deduction for first order minimal logic in Agda, and verify minimal logic proofs and natural deduction properties in the resulting proof system. We study the implications of adding the drinker paradox and other formula schemata to minimal logic. We show first that these principles are independent of the law of excluded middle and of each other, and second how these schemata relate to other well-known principles, such as Markov’s Principle of unbounded search, providing proofs and semantic models where appropriate. We show that Bishop’s constructive analysis can be adapted to minimal logic. Acknowledgements Many thanks to Hannes Diener and Maarten McKubre-Jordens for their wonderful supervision. Their encouragement and guidance was the primary reason why my studies have been an enjoyable and relatively non-stressful experience. I am thankful for their suggestions and advice, and that they encouraged me to also pursue the questions I found interesting. Thanks also to Douglas Bridges, whose lectures inspired my interest in logic. I cannot imagine a better foundation for a constructivist. I am grateful to the University of Canterbury for funding my research, to CORCON for funding my secondments, and to my hosts Helmut Schwichtenberg in Munich, Ulrich Berger and Monika Seisenberger in Swansea, and Milly Maietti and Giovanni Sambin in Padua. This thesis is dedicated to Bertrand and Hester Warren, to whom I express my deepest gratitude. -
Basic Concepts of Set Theory, Functions and Relations 1. Basic
Ling 310, adapted from UMass Ling 409, Partee lecture notes March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory........................................................................................................................1 1.1. Sets and elements ...................................................................................................................................1 1.2. Specification of sets ...............................................................................................................................2 1.3. Identity and cardinality ..........................................................................................................................3 1.4. Subsets ...................................................................................................................................................4 1.5. Power sets .............................................................................................................................................4 1.6. Operations on sets: union, intersection...................................................................................................4 1.7 More operations on sets: difference, complement...................................................................................5 1.8. Set-theoretic equalities ...........................................................................................................................5 Chapter 2. Relations and Functions ..................................................................................................................6 -
The Broadest Necessity
The Broadest Necessity Andrew Bacon∗ July 25, 2017 Abstract In this paper we explore the logic of broad necessity. Definitions of what it means for one modality to be broader than another are formulated, and we prove, in the context of higher-order logic, that there is a broadest necessity, settling one of the central questions of this investigation. We show, moreover, that it is possible to give a reductive analysis of this necessity in extensional language (using truth functional connectives and quantifiers). This relates more generally to a conjecture that it is not possible to define intensional connectives from extensional notions. We formulate this conjecture precisely in higher-order logic, and examine concrete cases in which it fails. We end by investigating the logic of broad necessity. It is shown that the logic of broad necessity is a normal modal logic between S4 and Triv, and that it is consistent with a natural axiomatic system of higher-order logic that it is exactly S4. We give some philosophical reasons to think that the logic of broad necessity does not include the S5 principle. 1 Say that a necessity operator, 21, is as broad as another, 22, if and only if: (*) 23(21P ! 22P ) whenever 23 is a necessity operator, and P is a proposition. Here I am quantifying both into the position that an operator occupies, and the position that a sentence occupies. We shall give details of the exact syntax of the language we are theorizing in shortly: at this point, we note that it is a language that contains operator variables, sentential variables, and that one can accordingly quantify into sentence and operator position. -
Which Quantifiers Are Logical? a Combined Semantical and Inferential Criterion Solomon Feferman1
Which Quantifiers are Logical? A combined semantical and inferential criterion Solomon Feferman1 Abstract. The aim of logic is to characterize the forms of reasoning that lead invariably from true sentences to true sentences, independently of the subject matter; thus its concerns combine semantical and inferential notions in an essential way. Up to now most proposed characterizations of logicality of sentence generating operations have been given either in semantical or inferential terms. This paper offers a combined semantical and inferential criterion for logicality (improving one originally proposed by Jeffery Zucker) and shows that any quantifier that is to be counted as logical according to that criterion is definable in first order logic. The aim of logic is to characterize the forms of reasoning that lead invariably from true sentences to true sentences, independently of the subject matter. The sentences involved are analyzed according to their logical (as opposed to grammatical) structure, i.e. how they are compounded from their parts by means of certain operations on propositions and predicates, of which the familiar ones are the connectives and quantifiers of first order logic. To spell this out in general, one must explain how the truth of compounds under given operations is determined by the truth of the parts, and characterize those forms of rules of inference for the given operations that insure preservation of truth. The so-called problem of “logical constants” (Gomez-Torrente 2002) is to determine all such operations. -
The Nature of Logical Constants
Aporia vol. 27 no. 1—2017 The Nature of Logical Constants LAUREN RICHARDSON haracterizing the distinction between the “logical” and “non-logical” expressions of a language proves a challenging task, and one Cwith significant implications for the nature and scope of logic itself. It is often claimed that logical truths are statements that are “true by virtue of form,” and, likewise, that arguments are logically valid because of their respective “forms,” not because of their contents (Sider 2).1 Take, for example, a straightforward piece of reasoning: (P1) Maria is in Berlin or she is in Vienna. (P2) Maria is not in Berlin. (C) Maria is in Vienna. If this argument is valid—which, of course, in classical logic, it is—then it is typically held to be valid because of the structure of the argument and not because of certain material facts about the world. So it seems as if we should 1 Contrast the idea of truth preservation by virtue of form with the idea of an argument that is truth- preserving by virtue of the meaning of certain terms: (P1*):Nick is a bachelor. (C*): Nick is an unmarried man. We might think that the truth of (P1*) guarantees the truth of (C*), but it is not by virtue of the form of the argument; it is by virtue of the meaning of the expressions “bachelor” and “unmarried man.” Lauren Richardson is studying philosophy at the University of Chicago and will graduate in 2018. Her philosophical interests include philosophy of language, logic, metaethics, and feminism. After graduation, Lauren intends to pursue a graduate degree in philosophy. -
Understanding the Logical Constants and Dispositions
Baltic International Yearbook of Cognition, Logic and Communication Volume 5 MEANING, UNDERSTANDING AND KNOWLEDGE Article 2 2009 Understanding the Logical Constants and Dispositions Corine Besson St Hugh's College, Oxford Follow this and additional works at: https://newprairiepress.org/biyclc This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License. Recommended Citation Besson, Corine (2009) "Understanding the Logical Constants and Dispositions," Baltic International Yearbook of Cognition, Logic and Communication: Vol. 5. https://doi.org/10.4148/biyclc.v5i0.279 This Proceeding of the Symposium for Cognition, Logic and Communication is brought to you for free and open access by the Conferences at New Prairie Press. It has been accepted for inclusion in Baltic International Yearbook of Cognition, Logic and Communication by an authorized administrator of New Prairie Press. For more information, please contact [email protected]. Understanding the Logical Constants and Dispositions 2 The Baltic International Yearbook of not explore here how that explanatory connection might be accounted Cognition, Logic and Communication for. But however it is accounted for, it seems that the following min- imal constraint should be met by any account of competence with an October 2010 Volume 5: Meaning, Understanding and Knowledge expression: pages 1-24 DOI: 10.4148/biyclc.v5i0.279 (CT) An account of speakers’ understanding of an expres- sion should be consistent with their correct performances CORINE BESSON with that expression. St Hugh’s College, Oxford This is a weak constraint, since the connection between competence and performance is much tighter. But this will suffice for the purposes UNDERSTANDING THE LOGICAL CONSTANTS AND of this paper. -
The Development of Mathematical Logic from Russell to Tarski: 1900–1935
The Development of Mathematical Logic from Russell to Tarski: 1900–1935 Paolo Mancosu Richard Zach Calixto Badesa The Development of Mathematical Logic from Russell to Tarski: 1900–1935 Paolo Mancosu (University of California, Berkeley) Richard Zach (University of Calgary) Calixto Badesa (Universitat de Barcelona) Final Draft—May 2004 To appear in: Leila Haaparanta, ed., The Development of Modern Logic. New York and Oxford: Oxford University Press, 2004 Contents Contents i Introduction 1 1 Itinerary I: Metatheoretical Properties of Axiomatic Systems 3 1.1 Introduction . 3 1.2 Peano’s school on the logical structure of theories . 4 1.3 Hilbert on axiomatization . 8 1.4 Completeness and categoricity in the work of Veblen and Huntington . 10 1.5 Truth in a structure . 12 2 Itinerary II: Bertrand Russell’s Mathematical Logic 15 2.1 From the Paris congress to the Principles of Mathematics 1900–1903 . 15 2.2 Russell and Poincar´e on predicativity . 19 2.3 On Denoting . 21 2.4 Russell’s ramified type theory . 22 2.5 The logic of Principia ......................... 25 2.6 Further developments . 26 3 Itinerary III: Zermelo’s Axiomatization of Set Theory and Re- lated Foundational Issues 29 3.1 The debate on the axiom of choice . 29 3.2 Zermelo’s axiomatization of set theory . 32 3.3 The discussion on the notion of “definit” . 35 3.4 Metatheoretical studies of Zermelo’s axiomatization . 38 4 Itinerary IV: The Theory of Relatives and Lowenheim’s¨ Theorem 41 4.1 Theory of relatives and model theory . 41 4.2 The logic of relatives . -
Definitions and Nondefinability in Geometry 475 2
Definitions and Nondefinability in Geometry1 James T. Smith Abstract. Around 1900 some noted mathematicians published works developing geometry from its very beginning. They wanted to supplant approaches, based on Euclid’s, which han- dled some basic concepts awkwardly and imprecisely. They would introduce precision re- quired for generalization and application to new, delicate problems in higher mathematics. Their work was controversial: they departed from tradition, criticized standards of rigor, and addressed fundamental questions in philosophy. This paper follows the problem, Which geo- metric concepts are most elementary? It describes a false start, some successful solutions, and an argument that one of those is optimal. It’s about axioms, definitions, and definability, and emphasizes contributions of Mario Pieri (1860–1913) and Alfred Tarski (1901–1983). By fol- lowing this thread of ideas and personalities to the present, the author hopes to kindle interest in a fascinating research area and an exciting era in the history of mathematics. 1. INTRODUCTION. Around 1900 several noted mathematicians published major works on a subject familiar to us from school: developing geometry from the very beginning. They wanted to supplant the established approaches, which were based on Euclid’s, but which handled awkwardly and imprecisely some concepts that Euclid did not treat fully. They would present geometry with the precision required for general- ization and applications to new, delicate problems in higher mathematics—precision beyond the norm for most elementary classes. Work in this area was controversial: these mathematicians departed from tradition, criticized previous standards of rigor, and addressed fundamental questions in logic and philosophy of mathematics.2 After establishing background, this paper tells a story about research into the ques- tion, Which geometric concepts are most elementary? It describes a false start, some successful solutions, and a demonstration that one of those is in a sense optimal. -
The Constituents of the Propositions of Logic Kevin C
10 The Constituents of the Propositions of Logic Kevin C. Klement 1 Introduction Many founders of modern logic—Frege and Russell among them—bemoan- ed the tendency, still found in most textbook treatments, to define the subject matter of logic as “the laws of thought” or “the principles of inference”. Such descriptions fail to capture logic’s objective nature; they make it too dependent on human psychology or linguistic practices. It is one thing to identify what logic is not about. It is another to say what it is about. I tell my students that logic studies relationships between the truth-values of propositions that hold in virtue of their form. But even this characterization leaves me uneasy. I don’t really know what a “form” is, and even worse perhaps, I don’t really know what these “propositions” are that have these forms. If propositions are considered merely as sentences or linguistic assertions, the definition does not seem like much of an improvement over the psychological definitions. Language is a human invention, but logic is more than that, or so it seems. It is perhaps forgiveable then that at certain times Russell would not have been prepared to give a very good answer to the question “What is Logic?”, such as when he attempted, but failed, to compose a paper with that title in October 1912. Given that Russell had recently completed Principia Mathematica, a work alleging to establish the reducibility of mathematics to logic, one might think this overly generous. What does the claim that mathematics reduces to logic come to if we cannot independently speci- Published in Acquaintance, Knowledge and Logic: New Essays on Bertrand Russell’s Problems of Philosophy, edited by Donovan Wishon and Bernard Linsky. -
The Bounds of Logic Part 2
To Ik a Logical Term 37 Chapter 3 To Be a Logical Ternl logic; at the same time, the principles developed by Tarski in the 1930s are still the principles underlying logic in the early 1990s. My interest in Tarski is, Ileedless to say, not historical. I am interested in the modern conception of logic as it evolved out of Tarski's early work in semantics. The Task of Logic and the Origins of Semantics In "The Concept of Truth in Formalized Languages" (1933). "On the Concept of Logical Consequence" (1936a), and "The Establishment of Scientific Semantics" (1936b), Tarski describes the semantic project as comprising two tasks: Since the discovery ofgeneralized quantifiers by A. Mostowski (1957), the I. Definition of the gelleral concept of truth for formalized languages question "What is a logical term?" has taken on a significance it did not 2. Dclinition of the logical concepts of truth, consequence, consistency. have before. Are Mostowski's quantifiers Hlogical" quantifiers'! Do they etc. , differ in any significant way from the standard existential and universal The main purpose of (I) is to secure meta logic against semantic para I quantifiers? What logical operators, if any, has he left out? What. ill doxes. Tarski worried lest the ullcritical usc of semantic concepts prior to I all, are the first- and second-level predicates and rcla tions that can be his work concealed an inconsistency: a hidden fallacy would undermine construed as logical? the cntire venturc. Be therefore sought precise, materially, as well as One way in which I do not want to ask the question is, "What, ill Ihe formally, correct definitions of "truth" and related notions to serve as a I nature ofthings, makes a property or a relation logical'!" On this road lie hedge against paradox.