Informal and Formal Proofs, Metalogic, and the Groundedness Problem
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Revisiting Gödel and the Mechanistic Thesis Alessandro Aldini, Vincenzo Fano, Pierluigi Graziani
Theory of Knowing Machines: Revisiting Gödel and the Mechanistic Thesis Alessandro Aldini, Vincenzo Fano, Pierluigi Graziani To cite this version: Alessandro Aldini, Vincenzo Fano, Pierluigi Graziani. Theory of Knowing Machines: Revisiting Gödel and the Mechanistic Thesis. 3rd International Conference on History and Philosophy of Computing (HaPoC), Oct 2015, Pisa, Italy. pp.57-70, 10.1007/978-3-319-47286-7_4. hal-01615307 HAL Id: hal-01615307 https://hal.inria.fr/hal-01615307 Submitted on 12 Oct 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License Theory of Knowing Machines: Revisiting G¨odeland the Mechanistic Thesis Alessandro Aldini1, Vincenzo Fano1, and Pierluigi Graziani2 1 University of Urbino \Carlo Bo", Urbino, Italy falessandro.aldini, [email protected] 2 University of Chieti-Pescara \G. D'Annunzio", Chieti, Italy [email protected] Abstract. Church-Turing Thesis, mechanistic project, and G¨odelian Arguments offer different perspectives of informal intuitions behind the relationship existing between the notion of intuitively provable and the definition of decidability by some Turing machine. One of the most for- mal lines of research in this setting is represented by the theory of know- ing machines, based on an extension of Peano Arithmetic, encompassing an epistemic notion of knowledge formalized through a modal operator denoting intuitive provability. -
An Un-Rigorous Introduction to the Incompleteness Theorems∗
An un-rigorous introduction to the incompleteness theorems∗ phil 43904 Jeff Speaks October 8, 2007 1 Soundness and completeness When discussing Russell's logical system and its relation to Peano's axioms of arithmetic, we distinguished between the axioms of Russell's system, and the theorems of that system. Roughly, the axioms of a theory are that theory's basic assumptions, and the theorems are the formulae provable from the axioms using the rules provided by the theory. Suppose we are talking about the theory A of arithmetic. Then, if we express the idea that a certain sentence p is a theorem of A | i.e., provable from A's axioms | as follows: `A p Now we can introduce the notion of the valid sentences of a theory. For our purposes, think of a valid sentence as a sentence in the language of the theory that can't be false. For example, consider a simple logical language which contains some predicates (written as upper-case letters), `not', `&', and some names, each of which is assigned some object or other in each interpretation. Now consider a sentence like F n In most cases, a sentence like this is going to be true on some interpretations, and false in others | it depends on which object is assigned to `n', and whether it is in the set of things assigned to `F '. However, if we consider a sentence like ∗The source for much of what follows is Michael Detlefsen's (much less un-rigorous) “G¨odel'stheorems", available at http://www.rep.routledge.com/article/Y005. -
Q1: Is Every Tautology a Theorem? Q2: Is Every Theorem a Tautology?
Section 3.2: Soundness Theorem; Consistency. Math 350: Logic Class08 Fri 8-Feb-2001 This section is mainly about two questions: Q1: Is every tautology a theorem? Q2: Is every theorem a tautology? What do these questions mean? Review de¯nitions, and discuss. We'll see that the answer to both questions is: Yes! Soundness Theorem 1. (The Soundness Theorem: Special case) Every theorem of Propositional Logic is a tautol- ogy; i.e., for every formula A, if A, then = A. ` j Sketch of proof: Q: Is every axiom a tautology? Yes. Why? Q: For each of the four rules of inference, check: if the antecedent is a tautology, does it follow that the conclusion is a tautology? Q: How does this prove the theorem? A: Suppose we have a proof, i.e., a list of formulas: A1; ; An. A1 is guaranteed to be a tautology. Why? So A2 is guaranteed to be a tautology. Why? S¢o¢ ¢A3 is guaranteed to be a tautology. Why? And so on. Q: What is a more rigorous way to prove this? Ans: Use induction. Review: What does S A mean? What does S = A mean? Theorem 2. (The Soun`dness Theorem: General cjase) Let S be any set of formulas. Then every theorem of S is a tautological consequence of S; i.e., for every formula A, if S A, then S = A. ` j Proof: This uses similar ideas as the proof of the special case. We skip the proof. Adequacy Theorem 3. (The Adequacy Theorem for the formal system of Propositional Logic: Special Case) Every tautology is a theorem of Propositional Logic; i.e., for every formula A, if = A, then A. -
Proof of the Soundness Theorem for Sentential Logic
The Soundness Theorem for Sentential Logic These notes contain a proof of the Soundness Theorem for Sentential Logic. The Soundness Theorem says that our natural deduction proofs represent a sound (or correct) system of reasoning. Formally, the Soundness Theorem states that: If Γ├ φ then Γ╞ φ. This says that for any set of premises, if you can prove φ from that set, then φ is truth-functionally entailed by that set. In other words, if our rules let you prove that something follows from some premises, then it ‘really does’ follow from those premises. By definition Γ╞ φ means that there is no TVA that makes all of the members of Γ true and also makes φ false. Note that an equivalent definition would be “Γ╞ φ if any TVA that makes all the members of Γ true also makes φ true”. By contraposition, the soundness theorem is equivalent to “If it is not true that Γ╞ φ then it is not true that Γ├ φ.” Unpacking the definitions, this means “If there is a TVA that makes all the members of Γ true but makes φ false, then there is no way to prove φ from Γ.” We might call this “The Negative Criterion.” This is important since the standard way of showing that something is not provable is to give an invalidating TVA. This only works assuming that the soundness theorem is true. Let’s get started on the proof. We are trying to prove a conditional claim, so we assume its antecedent and try to prove its consequent. -
Truth-Conditions
PLIN0009 Semantic Theory Spring 2020 Lecture Notes 1 1 What this module is about This module is an introduction to truth-conditional semantics with a focus on two impor- tant topics in this area: compositionality and quantiication. The framework adopted here is often called formal semantics and/or model-theoretical semantics, and it is characterized by its essential use of tools and concepts developed in mathematics and logic in order to study semantic properties of natural languages. Although no textbook is required, I list some introductory textbooks below for your refer- ence. • L. T. F. Gamut (1991) Logic, Language, and Meaning. The University of Chicago Press. • Irene Heim & Angelika Kratzer (1998) Semantics in Generative Grammar. Blackwell. • Thomas Ede Zimmermann & Wolfgang Sternefeld (2013) Introduction to Semantics: An Essential Guide to the Composition of Meaning. De Gruyter Mouton. • Pauline Jacobson (2014) Compositional Semantics: An Introduction to the Syntax/Semantics. Oxford University Press. • Daniel Altshuler, Terence Parsons & Roger Schwarzschild (2019) A Course in Semantics. MIT Press. There are also several overview articles of the ield by Barbara H. Partee, which I think are enjoyable. • Barbara H. Partee (2011) Formal semantics: origins, issues, early impact. In Barbara H. Partee, Michael Glanzberg & Jurģis Šķilters (eds.), Formal Semantics and Pragmatics: Discourse, Context, and Models. The Baltic Yearbook of Cognition, Logic, and Communica- tion, vol. 6. Manhattan, KS: New Prairie Press. • Barbara H. Partee (2014) A brief history of the syntax-semantics interface in Western Formal Linguistics. Semantics-Syntax Interface, 1(1): 1–21. • Barbara H. Partee (2016) Formal semantics. In Maria Aloni & Paul Dekker (eds.), The Cambridge Handbook of Formal Semantics, Chapter 1, pp. -
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 . -
Lecture 1: Tarski on Truth Philosophy of Logic and Language — HT 2016-17
Lecture 1: Tarski on Truth Philosophy of Logic and Language — HT 2016-17 Jonny McIntosh [email protected] Alfred Tarski (1901-1983) was a Polish (and later, American) mathematician, logician, and philosopher.1 In the 1930s, he published two classic papers: ‘The Concept of Truth in Formalized Languages’ (1933) and ‘On the Concept of Logical Consequence’ (1936). He gives a definition of truth for formal languages of logic and mathematics in the first paper, and the essentials of the model-theoretic definition of logical consequence in the second. Over the course of the next few lectures, we’ll look at each of these in turn. 1 Background The notion of truth seems to lie at the centre of a range of other notions that are central to theorising about the formal languages of logic and mathematics: e.g. validity, con- sistency, and completeness. But the notion of truth seems to give rise to contradiction: Let sentence (1) = ‘sentence (1) is not true’. Then: 1. ‘sentence (1) is not true’ is true IFF sentence (1) is not true 2. sentence (1) = ‘sentence (1) is not true’ 3. So, sentence (1) is true IFF sentence (1) is not true 4. So, sentence (1) is true and sentence (1) is not true Tarski is worried that, unless the paradox can be resolved, metatheoretical results in- voking the notion of truth or other notions that depend on it will be remain suspect. But how can it be resolved? The second premise is undeniable, and the first premise is an instance of a schema that seems central to the concept of truth, namely the following: ‘S’ is true IFF S, 1The eventful story of Tarski’s life is told by Anita and Solomon Feferman in their wonderful biography, Alfred Tarski: Life and Logic (CUP, 2004). -
Conceptual Semantics and Natural Semantic Metalanguage Theory 413
1 Conceptual semantics and natural semantic 2 metalanguage theory have different goals 3 4 5 RAY JACKENDOFF 6 7 8 9 10 11 12 My interview with Istvan Kecskes, ‘‘On Conceptual Semantics (OCS),’’ 13 o¤ers some brief remarks on the relation of my approach to Anna Wierz- 14 bicka’s theory of semantic primitives, Natural Language Metalanguage 15 Theory (NSM). Wierzbicka’s response, ‘‘Theory and Empirical Findings: 16 A Response to Jackendo¤’’ (henceforth TEF) calls for some further 17 commentary. 18 My remarks began, ‘‘Although I think Wierzbicka has o¤ered many in- 19 sightful discussions of word meaning, I do not think that her approach 20 ultimately responds to the goals of Conceptual Semantics.’’ TEF makes 21 it clear that Conceptual Semantics does not respond to the goals of 22 NSM either. That is, the two theories, although they overlap on some 23 issues of word meaning, are ultimately asking di¤erent questions and set- 24 ting di¤erent standards for answers. 25 Conceptual Semantics is concerned not only with encoding word mean- 26 ings but also with accounting for (a) the combination of word meanings 27 into phrase and sentence meanings, (b) the character of inference, both 28 logical and heuristic, and (c) the relation of linguistic meaning to nonlin- 29 guistic understanding of the world, including the aspects of understanding 30 provided through the perceptual systems. Conceptual Semantics in turn 31 is embedded in a theory of the organization of language, the Parallel Ar- 32 chitecture (Jackendo¤ 2002, Culicover and Jackendo¤ 2005), which ad- 33 dresses the relation of semantics to syntax, phonology, and the lexicon. -
Constructing a Categorical Framework of Metamathematical Comparison Between Deductive Systems of Logic
Bard College Bard Digital Commons Senior Projects Spring 2016 Bard Undergraduate Senior Projects Spring 2016 Constructing a Categorical Framework of Metamathematical Comparison Between Deductive Systems of Logic Alex Gabriel Goodlad Bard College, [email protected] Follow this and additional works at: https://digitalcommons.bard.edu/senproj_s2016 Part of the Logic and Foundations Commons This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License. Recommended Citation Goodlad, Alex Gabriel, "Constructing a Categorical Framework of Metamathematical Comparison Between Deductive Systems of Logic" (2016). Senior Projects Spring 2016. 137. https://digitalcommons.bard.edu/senproj_s2016/137 This Open Access work is protected by copyright and/or related rights. It has been provided to you by Bard College's Stevenson Library with permission from the rights-holder(s). You are free to use this work in any way that is permitted by the copyright and related rights. For other uses you need to obtain permission from the rights- holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/or on the work itself. For more information, please contact [email protected]. Constructing a Categorical Framework of Metamathematical Comparison Between Deductive Systems of Logic A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College by Alex Goodlad Annandale-on-Hudson, New York May, 2016 Abstract The topic of this paper in a broad phrase is \proof theory". It tries to theorize the general notion of \proving" something using rigorous definitions, inspired by previous less general theories. The purpose for being this general is to eventually establish a rigorous framework that can bridge the gap when interrelating different logical systems, particularly ones that have not been as well defined rigorously, such as sequent calculus. -
Metalanguage of Race”
608 y Symposium: “The Metalanguage of Race” Difference, Power, and Lived Experiences: Revisiting the “Metalanguage of Race” Dayo F. Gore first encountered Evelyn Brooks Higginbotham’s “African-American I Women’s History and the Metalanguage of Race” (1992) as a graduate student in a women’s history course in 1996, and the article has traveled with me ever since. I have assigned the article in at least one of my courses every year, even as I’ve taught across a number of fields, including African American history, feminist theory, and social movement history. Moreover, it has been one of the key theoretical texts I have employed to frame my own research and writing. Although I came to the article after it had been in circulation for four years, it resonated with me as a powerful and much- needed intervention in feminist theory and women’shistory.Indeed,“Meta- language” stands as one of those rare articles that continues to be relevant in ongoing debates about gender, sexuality, and race, and serves as a useful guidepost for my own scholarship. Higginbotham’s article provides an incisive response to debates among a broad spectrum of feminist scholars about how to be attentive to gender across difference and differently lived experiences, and it represented an im- portant addition to the theorization of what would become popularly known as intersectionality. Black feminist legal scholar Kimberlé Crenshaw is most often credited with coining the term “intersectionality” as she details it in two key articles, “Demarginalizing the Intersection of Race and Sex,” pub- lished in 1989, and “Mapping the Margins,” a law review article published in 1991. -
Propositional Calculus
CSC 438F/2404F Notes Winter, 2014 S. Cook REFERENCES The first two references have especially influenced these notes and are cited from time to time: [Buss] Samuel Buss: Chapter I: An introduction to proof theory, in Handbook of Proof Theory, Samuel Buss Ed., Elsevier, 1998, pp1-78. [B&M] John Bell and Moshe Machover: A Course in Mathematical Logic. North- Holland, 1977. Other logic texts: The first is more elementary and readable. [Enderton] Herbert Enderton: A Mathematical Introduction to Logic. Academic Press, 1972. [Mendelson] E. Mendelson: Introduction to Mathematical Logic. Wadsworth & Brooks/Cole, 1987. Computability text: [Sipser] Michael Sipser: Introduction to the Theory of Computation. PWS, 1997. [DSW] M. Davis, R. Sigal, and E. Weyuker: Computability, Complexity and Lan- guages: Fundamentals of Theoretical Computer Science. Academic Press, 1994. Propositional Calculus Throughout our treatment of formal logic it is important to distinguish between syntax and semantics. Syntax is concerned with the structure of strings of symbols (e.g. formulas and formal proofs), and rules for manipulating them, without regard to their meaning. Semantics is concerned with their meaning. 1 Syntax Formulas are certain strings of symbols as specified below. In this chapter we use formula to mean propositional formula. Later the meaning of formula will be extended to first-order formula. (Propositional) formulas are built from atoms P1;P2;P3;:::, the unary connective :, the binary connectives ^; _; and parentheses (,). (The symbols :; ^ and _ are read \not", \and" and \or", respectively.) We use P; Q; R; ::: to stand for atoms. Formulas are defined recursively as follows: Definition of Propositional Formula 1) Any atom P is a formula. -
PHIL 677 Lec 01 Metalogic Fall Term 2019 MW 14:00–15:15, Math Sciences 319
PHIL 677 Lec 01 Metalogic Fall Term 2019 MW 14:00–15:15, Math Sciences 319 Course Outline Instructor: Richard Zach (he/him) Email: [email protected] Oce: Social Sciences 1230 Oce Hours: MW 13:00–13:50, or by appointment Phone: (403) 220–3170 Teaching Assistant: Weidong Sun (he/him) Email: [email protected] Oce: Social Sciences 1242 Oce Hours: T 15:40-16:40, R 10:00–11:00 Phone: (403) 220–6464 Email is preferred over phone. However please keep the following in mind: 1. Please ensure that “Phil 677” or some other clearly identifying term occurs in the subject line. Otherwise there is a strong possibility that your message will be deleted unread as spam. 2. If you email to make an appointment please indicate the times when you are available. 3. Please make sure your first and last names are clearly included in the body of any email message. 4. We will not respond to email after 7pm or on weekends. 1 Course Information Formal logic has many applications both within philosophy and outside (espe- cially in mathematics, computer science, and linguistics). This second course will introduce you to the concepts, results, and methods of formal logic neces- sary to understand and appreciate these applications as well as the limitations of formal logic. It will be mathematical in that you will be required to master abstract formal concepts and to prove theorems about logic; but it does not presuppose any (advanced) knowledge of mathematics. We will start from the basics. We will begin by studying some basic formal concepts: sets, relations, and functions, and the sizes of infinite sets.