Aristotle and Principia Mathematica
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Dialetheists' Lies About the Liar
PRINCIPIA 22(1): 59–85 (2018) doi: 10.5007/1808-1711.2018v22n1p59 Published by NEL — Epistemology and Logic Research Group, Federal University of Santa Catarina (UFSC), Brazil. DIALETHEISTS’LIES ABOUT THE LIAR JONAS R. BECKER ARENHART Departamento de Filosofia, Universidade Federal de Santa Catarina, BRAZIL [email protected] EDERSON SAFRA MELO Departamento de Filosofia, Universidade Federal do Maranhão, BRAZIL [email protected] Abstract. Liar-like paradoxes are typically arguments that, by using very intuitive resources of natural language, end up in contradiction. Consistent solutions to those paradoxes usually have difficulties either because they restrict the expressive power of the language, orelse because they fall prey to extended versions of the paradox. Dialetheists, like Graham Priest, propose that we should take the Liar at face value and accept the contradictory conclusion as true. A logical treatment of such contradictions is also put forward, with the Logic of Para- dox (LP), which should account for the manifestations of the Liar. In this paper we shall argue that such a formal approach, as advanced by Priest, is unsatisfactory. In order to make contradictions acceptable, Priest has to distinguish between two kinds of contradictions, in- ternal and external, corresponding, respectively, to the conclusions of the simple and of the extended Liar. Given that, we argue that while the natural interpretation of LP was intended to account for true and false sentences, dealing with internal contradictions, it lacks the re- sources to tame external contradictions. Also, the negation sign of LP is unable to represent internal contradictions adequately, precisely because of its allowance of sentences that may be true and false. -
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. -
What Is the Value of Vagueness? By
THEORIA, 2021, 87, 752–780 doi:10.1111/theo.12313 What Is the Value of Vagueness? by DAVID LANIUS Karlsruher Institut fur Technologie Abstract: Classically, vagueness has been considered something bad. It leads to the Sorites para- dox, borderline cases, and the (apparent) violation of the logical principle of bivalence. Neverthe- less, there have always been scholars claiming that vagueness is also valuable. Many have pointed out that we could not communicate as successfully or efficiently as we do if we would not use vague language. Indeed, we often use vague terms when we could have used more precise ones instead. Many scholars (implicitly or explicitly) assume that we do so because their vagueness has a positive function. But how and in what sense can vagueness be said to have a function or value? This paper is an attempt to give an answer to this question. After clarifying the concepts of vague- ness and value, it examines nine arguments for the value of vagueness, which have been discussed in the literature. The (negative) result of this examination is, however, that there is not much rea- son to believe that vagueness has a value or positive function at all because none of the arguments is conclusive. A tenth argument that has not been discussed so far seems most promising but rests on a solely strategic notion of function. Keywords: vagueness, value of vagueness, indeterminacy, sorties paradox, function of vagueness 1. Introduction Almost since the beginning of the philosophical debate on vagueness, most peo- ple have seen it as a problem. It leads to the Sorites paradox, borderline cases, and the (apparent) violation of the logical principle of bivalence. -
Verifying the Unification Algorithm In
Verifying the Uni¯cation Algorithm in LCF Lawrence C. Paulson Computer Laboratory Corn Exchange Street Cambridge CB2 3QG England August 1984 Abstract. Manna and Waldinger's theory of substitutions and uni¯ca- tion has been veri¯ed using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an exam- ple of interaction with LCF. Translating the theory into LCF's domain- theoretic logic is largely straightforward. Well-founded induction on a complex ordering is translated into nested structural inductions. Cor- rectness of uni¯cation is expressed using predicates for such properties as idempotence and most-generality. The veri¯cation is presented as a series of lemmas. The LCF proofs are compared with the original ones, and with other approaches. It appears di±cult to ¯nd a logic that is both simple and exible, especially for proving termination. Contents 1 Introduction 2 2 Overview of uni¯cation 2 3 Overview of LCF 4 3.1 The logic PPLAMBDA :::::::::::::::::::::::::: 4 3.2 The meta-language ML :::::::::::::::::::::::::: 5 3.3 Goal-directed proof :::::::::::::::::::::::::::: 6 3.4 Recursive data structures ::::::::::::::::::::::::: 7 4 Di®erences between the formal and informal theories 7 4.1 Logical framework :::::::::::::::::::::::::::: 8 4.2 Data structure for expressions :::::::::::::::::::::: 8 4.3 Sets and substitutions :::::::::::::::::::::::::: 9 4.4 The induction principle :::::::::::::::::::::::::: 10 5 Constructing theories in LCF 10 5.1 Expressions :::::::::::::::::::::::::::::::: -
Two Sources of Explosion
Two sources of explosion Eric Kao Computer Science Department Stanford University Stanford, CA 94305 United States of America Abstract. In pursuit of enhancing the deductive power of Direct Logic while avoiding explosiveness, Hewitt has proposed including the law of excluded middle and proof by self-refutation. In this paper, I show that the inclusion of either one of these inference patterns causes paracon- sistent logics such as Hewitt's Direct Logic and Besnard and Hunter's quasi-classical logic to become explosive. 1 Introduction A central goal of a paraconsistent logic is to avoid explosiveness { the inference of any arbitrary sentence β from an inconsistent premise set fp; :pg (ex falso quodlibet). Hewitt [2] Direct Logic and Besnard and Hunter's quasi-classical logic (QC) [1, 5, 4] both seek to preserve the deductive power of classical logic \as much as pos- sible" while still avoiding explosiveness. Their work fits into the ongoing research program of identifying some \reasonable" and \maximal" subsets of classically valid rules and axioms that do not lead to explosiveness. To this end, it is natural to consider which classically sound deductive rules and axioms one can introduce into a paraconsistent logic without causing explo- siveness. Hewitt [3] proposed including the law of excluded middle and the proof by self-refutation rule (a very special case of proof by contradiction) but did not show whether the resulting logic would be explosive. In this paper, I show that for quasi-classical logic and its variant, the addition of either the law of excluded middle or the proof by self-refutation rule in fact leads to explosiveness. -
'The Denial of Bivalence Is Absurd'1
On ‘The Denial of Bivalence is Absurd’1 Francis Jeffry Pelletier Robert J. Stainton University of Alberta Carleton University Edmonton, Alberta, Canada Ottawa, Ontario, Canada [email protected] [email protected] Abstract: Timothy Williamson, in various places, has put forward an argument that is supposed to show that denying bivalence is absurd. This paper is an examination of the logical force of this argument, which is found wanting. I. Introduction Let us being with a word about what our topic is not. There is a familiar kind of argument for an epistemic view of vagueness in which one claims that denying bivalence introduces logical puzzles and complications that are not easily overcome. One then points out that, by ‘going epistemic’, one can preserve bivalence – and thus evade the complications. James Cargile presented an early version of this kind of argument [Cargile 1969], and Tim Williamson seemingly makes a similar point in his paper ‘Vagueness and Ignorance’ [Williamson 1992] when he says that ‘classical logic and semantics are vastly superior to…alternatives in simplicity, power, past success, and integration with theories in other domains’, and contends that this provides some grounds for not treating vagueness in this way.2 Obviously an argument of this kind invites a rejoinder about the puzzles and complications that the epistemic view introduces. Here are two quick examples. First, postulating, as the epistemicist does, linguistic facts no speaker of the language could possibly know, and which have no causal link to actual or possible speech behavior, is accompanied by a litany of disadvantages – as the reader can imagine. -
How the Law of Excluded Middle Pertains to the Second Incompleteness Theorem and Its Boundary-Case Exceptions
How the Law of Excluded Middle Pertains to the Second Incompleteness Theorem and its Boundary-Case Exceptions Dan E. Willard State University of New York .... Summary of article in Springer’s LNCS 11972, pp. 268-286 in Proc. of Logical Foundations of Computer Science - 2020 Talk was also scheduled to appear in ASL 2020 Conference, before Covid-19 forced conference cancellation S-0 : Comments about formats for these SLIDES 1 Slides 1-15 were presented at LFCS 2020 conference, meeting during Janaury 4-7, 2020, in Deerfield Florida (under a technically different title) 2 Published as refereed 19-page paper in Springer’s LNCS 11972, pp. 268-286 in Springer’s “Proceedings of Logical Foundations of Computer Science 2020” 3 Second presentaion of this talk was intended for ASL-2020 conference, before Covid-19 cancelled conference. Willard recommends you read Item 2’s 19-page paper after skimming these slides. They nicely summarize my six JSL and APAL papers. Manuscript is also more informative than the sketch outlined here. Manuscript helps one understand all of Willard’s papers 1. Main Question left UNANSWERED by G¨odel: 2nd Incomplet. Theorem indicates strong formalisms cannot verify their own consistency. ..... But Humans Presume Their Own Consistency, at least PARTIALLY, as a prerequisite for Thinking ? A Central Question: What systems are ADEQUATELY WEAK to hold some type (?) knowledge their own consistency? ONLY PARTIAL ANSWERS to this Question are Feasible because 2nd Inc Theorem is QUITE STRONG ! Let LXM = Law of Excluded Middle OurTheme: Different USES of LXM do change Breadth and LIMITATIONS of 2nd Inc Theorem 2a. -
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 -
Logic- Sentence and Propositions
Sentence and Proposition Sentence Sentence= वा啍य, Proposition= त셍कवा啍य/ प्रततऻप्तत=Statement Sentence is the unit or part of some language. Sentences can be expressed in all tense (present, past or future) Sentence is not able to explain quantity and quality. A sentence may be interrogative (प्रश्नवाच셍), simple or declarative (घोषड़ा配म셍), command or imperative (आदेशा配म셍), exclamatory (ववमयतबोध셍), indicative (तनदेशा配म셍), affirmative (भावा配म셍), negative (तनषेधा配म셍), skeptical (संदेहा配म셍) etc. Note : Only indicative sentences (सं셍ेता配म셍तवा啍य) are proposition. Philosophy Dept, E- contents-01( Logic-B.A Sem.III & IV) by Dr Rajendra Kr.Verma 1 All kind of sentences are not proposition, only those sentences are called proposition while they will determine or evaluate in terms of truthfulness or falsity. Sentences are governed by its own grammar. (for exp- sentence of hindi language govern by hindi grammar) Sentences are correct or incorrect / pure or impure. Sentences are may be either true or false. Philosophy Dept, E- contents-01( Logic-B.A Sem.III & IV) by Dr Rajendra Kr.Verma 2 Proposition Proposition are regarded as the material of our reasoning and we also say that proposition and statements are regarded as same. Proposition is the unit of logic. Proposition always comes in present tense. (sentences - all tenses) Proposition can explain quantity and quality. (sentences- cannot) Meaning of sentence is called proposition. Sometime more then one sentences can expressed only one proposition. Example : 1. ऩानीतबरसतरहातहैत.(Hindi) 2. ऩावुष तऩड़तोत (Sanskrit) 3. It is raining (English) All above sentences have only one meaning or one proposition. -
Are Large Cardinal Axioms Restrictive?
Are Large Cardinal Axioms Restrictive? Neil Barton∗ 24 June 2020y Abstract The independence phenomenon in set theory, while perva- sive, can be partially addressed through the use of large cardinal axioms. A commonly assumed idea is that large cardinal axioms are species of maximality principles. In this paper, I argue that whether or not large cardinal axioms count as maximality prin- ciples depends on prior commitments concerning the richness of the subset forming operation. In particular I argue that there is a conception of maximality through absoluteness, on which large cardinal axioms are restrictive. I argue, however, that large cardi- nals are still important axioms of set theory and can play many of their usual foundational roles. Introduction Large cardinal axioms are widely viewed as some of the best candi- dates for new axioms of set theory. They are (apparently) linearly ordered by consistency strength, have substantial mathematical con- sequences for questions independent from ZFC (such as consistency statements and Projective Determinacy1), and appear natural to the ∗Fachbereich Philosophie, University of Konstanz. E-mail: neil.barton@uni- konstanz.de. yI would like to thank David Aspero,´ David Fernandez-Bret´ on,´ Monroe Eskew, Sy-David Friedman, Victoria Gitman, Luca Incurvati, Michael Potter, Chris Scam- bler, Giorgio Venturi, Matteo Viale, Kameryn Williams and audiences in Cambridge, New York, Konstanz, and Sao˜ Paulo for helpful discussion. Two anonymous ref- erees also provided helpful comments, and I am grateful for their input. I am also very grateful for the generous support of the FWF (Austrian Science Fund) through Project P 28420 (The Hyperuniverse Programme) and the VolkswagenStiftung through the project Forcing: Conceptual Change in the Foundations of Mathematics. -
First Order Logic and Nonstandard Analysis
First Order Logic and Nonstandard Analysis Julian Hartman September 4, 2010 Abstract This paper is intended as an exploration of nonstandard analysis, and the rigorous use of infinitesimals and infinite elements to explore properties of the real numbers. I first define and explore first order logic, and model theory. Then, I prove the compact- ness theorem, and use this to form a nonstandard structure of the real numbers. Using this nonstandard structure, it it easy to to various proofs without the use of limits that would otherwise require their use. Contents 1 Introduction 2 2 An Introduction to First Order Logic 2 2.1 Propositional Logic . 2 2.2 Logical Symbols . 2 2.3 Predicates, Constants and Functions . 2 2.4 Well-Formed Formulas . 3 3 Models 3 3.1 Structure . 3 3.2 Truth . 4 3.2.1 Satisfaction . 5 4 The Compactness Theorem 6 4.1 Soundness and Completeness . 6 5 Nonstandard Analysis 7 5.1 Making a Nonstandard Structure . 7 5.2 Applications of a Nonstandard Structure . 9 6 Sources 10 1 1 Introduction The founders of modern calculus had a less than perfect understanding of the nuts and bolts of what made it work. Both Newton and Leibniz used the notion of infinitesimal, without a rigorous understanding of what they were. Infinitely small real numbers that were still not zero was a hard thing for mathematicians to accept, and with the rigorous development of limits by the likes of Cauchy and Weierstrass, the discussion of infinitesimals subsided. Now, using first order logic for nonstandard analysis, it is possible to create a model of the real numbers that has the same properties as the traditional conception of the real numbers, but also has rigorously defined infinite and infinitesimal elements. -
A New Logic for Uncertainty
A New Logic for Uncertainty ∗ LUO Maokang and HE Wei† Institute of Mathematics Institute of Mathematics Sichuan University Nanjing Normal University Chengdu, 610064 Nanjing, 210046 P.R.China P.R.China Abstract Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking truth value semantics and randomicity by taking probabilistic semantics or possibility semantics. As the first step for purpose of establishing a logic system which completely reflect the uncertainty of the objective world, this logic will lead to a set of logical foundations for uncertainty theory as what classical logic done in certain or definite situations or circumstances. Keywords: Fuzziness; randomicity; UL-algebra; uncertain propositional logic. Mathematics Subject Classifications(2000): 03B60. 1 Introduction As one of the most important and one of the most widely used concepts in the whole area of modern academic or technologic research, uncertainty has been involved into study and applications more than twenty years. Now along with the quickly expanding requirements of developments of science and technology, people are having to face and deal with more and more problems tangled with uncertainty in the fields of natural science, engineering or technology or even in social science. To these uncertain prob- arXiv:1506.03123v1 [math.LO] 9 Jun 2015 lems, many traditional theories and methods based on certain conditions or certain circumstances are not so effective and powerful as them in the past. So the importance of research on uncertainty is emerging more and more obviously and imminently.