The Legacy of Hilbert, Gödel, Gentzen and Turing


 Damon Jennings
 1 years ago
 Views:
Transcription
1 The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática  Instituto Superior Técnico Security and Quantum Information Group  Instituto de Telecomunicações TULisbon LMAC SEMINAR October 17, 2012
2 Abstract A brief survey of of formalizing mathematics, its initial successes, its failure, its most interesting ramifications, and its ultimate triumph (in a quite unexpected front).
3 Plan why? how? Initial successes first order logic (FOL) complete axiomatization of FOL symbolic proof of the consistency of FOL Disaster arithmetic is not axiomatizable consistency is not derivable in any rich fragment of arithmetic Other negative results halting problem is not decidable many other undecidability results
4 Plan (conc) Interesting ramifications independence results decidability of some useful fragments of mathematics practical applications of formal logic existence of computable universal functions Ultimate triumph advent of the universal computer the rest is history!
5 Why? : Why?
6 Why? Foundations of mathematics (late XIX century) Generalized use of sets in the foundations of mathematics, namely by Georg Cantor. Gottlob Frege s attempt at axiomatizing set theory using quantifiers. Bertrand Russell s paradox (1901), already by Ernst Zermelo (1900).
7 Why? Russel s paradox Inconsistency of Frege s axiomatization of sets Let R = {x : x x}. Then, R R R R.
8 Why? Hilbert s 2nd problem (1900) David Hilbert asked if mathematics is consistent free of any internal contradictions.
9 Why? But above all I wish to designate the following as the most important among the numerous questions which can be asked with regard to the axioms: To prove that they are not contradictory, that is, that a definite number of logical steps based upon them can never lead to contradictory results.... In geometry, the proof of the compatibility of the axioms can be effected by constructing a suitable field of numbers, such that analogous relations between the numbers of this field correspond to the geometrical axioms.... On the other hand a direct method is needed for the proof of the compatibility of the arithmetical axioms. David Hilbert
10 How? : How?
11 How? Hilbert s dream of checking the consistency of mathematics Hilbert proposed to ground all existing theories to a finite, complete set of axioms, and provide a proof that these axioms were consistent. The consistency of more complicated systems, such as real analysis, should be proven in terms of simpler systems. Ultimately, the consistency of the whole of mathematics should be reduced to the consistency of basic arithmetic.
12 How? Hilbert s program for mechanizing mathematics (1920) Formalization (inspired by Gottfried Wilhelm Leibniz): all mathematical statements should be written in a precise formal language, and manipulated according to well defined rules. Completeness: a proof that all true mathematical statements can be proved in the formalism. Consistency: a proof that no contradiction can be obtained in the formalism. Conservativeness: a proof that any result about real objects obtained using reasoning about ideal objects (such as uncountable sets) can be proved without using ideal objects. Decidability: there should be an algorithm for deciding the truth or falsity of any formal mathematical statement.
13 How? Early criticism of Hilbert s ideas Hermann Weyl described Hilbert s project as replacing contentual mathematics by a meaningless game of formulas. He noted that Hilbert wanted to secure not truth, but the consistency of analysis and suggested a criticism that echoes an earlier one by Gottlob Frege: Why should we take consistency of a formal system of mathematics as a reason to believe in the truth of the preformal mathematics it codifies? Is Hilbert s meaningless inventory of formulas not just the bloodless ghost of analysis?
14 Initial successes : Initial successes
15 Initial successes The first step: firstorder logic (FOL) Language = terms + formulas (p(0) ( x (p(x) p(x + 1)))) ( x p(x)) Calculus = decidable set of axioms + computable inference rules ( x p(x) p(t))... p(x), (p(x) q(x)) q(x)... Semantics = class of interpretations Interpretation = domain + relations + operations
16 Initial successes Expressive power of FOL FOL seemed good enough for the purpose of formally stating interesting mathematical properties For instance, the induction principle (p(0) ( x (p(x) p(x + 1)))) ( x p(x)) which should be present in any axiomatization of arithmetic.
17 Initial successes Completeness of FOL Kurt Gödel s completeness theorem (1929) Completeness of the axiomatization of FOL that specifies the properties of logic connectives and quantifiers and nothing else.
18 Initial successes Formal consistency of FOL Gerhard Gentzen s consistency theorem (1936) Proof by purely symbolic means of the consistency of the axiomatization of FOL (via a sequent calculus).
19 Disaster : Disaster
20 Disaster Gödel s incompleteness theorems (1931) First incompleteness theorem An axiomatization of arithmetic (capable of representing computable maps) cannot be both consistent and complete. Therefore, (sufficiently rich) arithmetic is not axiomatizable.
21 Disaster Gödel s incompleteness theorems (1931) Second incompleteness theorem Selfconsistency is not derivable from any sufficiently strong axiomatization of (a fragment of) arithmetic.
22 Disaster Kurt Gödel and Albert Einstein in Princeton (1950)
23 Disaster Other negative results First undecidable formal problems (1936) Alan Turing: halting problem. Alonzo Church: equivalence of λexpressions. Both provided a negative answer to the Entscheidungsproblem posed by Hilbert in 1928: Is there an algorithm capable of deciding if a formula is derivable in FOL from a given (decidable) set of formulas?
24 Disaster By the way... Undecidability of arithmetic truth Gödel s first incompleteness problem already provided an example of a nondecidable problem: Truth in a sufficiently rich arithmetic cannot be decidable (since it it is not even semidecidable because it cannot be axiomatized).
25 Disaster Yet another negative result Gregory Chaitin s incompleteness theorem (1987) In a sufficiently strong axiomatization of (a fragment of) arithmetic there is an upper bound L such that no specific number can be proven to have Kolmogorov complexity greater than L.
26 Disaster The death of formal logic? Formal logic rejected by most mathematicians? Unfortunately yes... A great misunderstanding indeed... >>> a mistake that none of you will commit, I hope... <<<
27 Interesting ramifications : Interesting ramifications
28 Interesting ramifications The death of formal logic? Not quite... Useful decidable fragments of mathematics e.g. Mojzesz Presburger s arithmetic (1929); Alfred Tarski s theories of algebraically closed fields (1949), real closed fields (1951).
29 Interesting ramifications The death of formal logic? Not quite... Formal logic remains relevant to mathematics Better understanding of the foundations of mathematics e.g. Kurt Gödel s (1940) and Paul Cohen s (1963) independence results, namely concerning Zermelo s axiom of choice and Cantor s continuum hypothesis. Work goes on... Development of techniques, namely those coming out of FOL model theory, recently used in other areas of mathematics.
30 Interesting ramifications The death of formal logic? Not quite... Practical applications of formal logic in software engineering and artificial intelligence Formal logic is routinely and widely used today for: reasoning about programs and protocols (analysis and synthesis); knowledge representation. Notwithstanding its roots in the foundations of mathematics, formal logic is now (also) a branch of applied mathematics! Thus, also mandatory in the curriculum of applied mathematicians and computer scientists/engineers.
31 Interesting ramifications Another outcome of : the universal Turing machine A machine that can emulate every machine ( ) Alan Turing conceived a computing machine that could be made to emulate any computing machine. U M p x U(p, x) = M(x)
32 Interesting ramifications The universal programmable computer A machine that can be programmed to compute any computable function Long after the programmable analytical engine had been proposed by Charles Babbage (1834), thanks to the theoretical contributions by Alan Turing, the idea of the programmable computer had arrived for good... The rest is history!
33 Ultimate triumph : Ultimate triumph
34 Ultimate triumph The economic and social success of The practical impact of The work on (although not successful per se) made significant contributions to the advent of the concept of computable function, which led to the notion of universal computer and, thus, to the triggering of the latest industrial revolution on which our affluent way of life stands.
35 Where to learn more Where to learn more...
36 Where to learn more Start learning about the rise of modern logic Hilbert s program s program Gödel s completeness theorem s completeness theorem Gentzen s consistency proof s consistency proof
37 Where to learn more Start learning about the rise of modern logic (conc) Gödel s incompleteness theorems s incompleteness theorems Turing s contributions LMAC course in Mathematical Logic, year 2, semester 2
38 Where to learn more You can also start having fun now! And if you would like to work in logic, computability or complexity by all means come up to the 5th foor. You will be most welcome.
The Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationMathematical Logic. Giuseppe Peano ( ) Core Logic 2004/051ab p. 2/2
Mathematical Logic. From the XIXth century to the 1960s, logic was essentially mathematical. Development of firstorder logic (18791928): Frege, Hilbert, Bernays, Ackermann. Development of the fundamental
More informationPropositions as Types
Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......
More informationLogic in Computer Science. Frank Wolter
Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.
More informationClassical Propositional Logic
The Language of A Henkinstyle Proof for Natural Deduction January 16, 2013 The Language of A Henkinstyle Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationComputability Theory. CS215, Lecture 6,
Computability Theory CS215, Lecture 6, 2000 1 The Birth of Turing Machines At the end of the 19th century, Gottlob Frege conjectured that mathematics could be built from fundamental logic In 1900 David
More informationPoincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid
Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid Henry Poincaré (18541912) nonlinear dynamics Werner Heisenberg (19011976) uncertainty
More informationGödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel
Gödel s Proof Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College Kurt Gödel 24.4.0614.1.78 1 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA MATHEMATICA AND RELATED SYSTEMS 11 by Kurt Gödel,
More informationInstitute for Applied Information Processing and Communications (IAIK) Secure & Correct Systems. Decidability
Decidability and the Undecidability of Predicate Logic IAIK Graz University of Technology georg.hofferek@iaik.tugraz.at 1 Fork of ways Brainteaser: Labyrinth Guards One to salvation One to perdition Two
More informationHilbert and the concept of axiom
Hilbert and the concept of axiom Giorgio Venturi Scuola Normale Superiore di Pisa Giorgio Venturi (SNS) Hilbert and the concept of axiom 1/24 First period Axiomatic method in the first period The actual
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity ResourceBounded KComplexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationCardinality of Sets. P. Danziger
MTH 3476 Cardinality of Sets P Danziger Cardinal vs Ordinal Numbers If we look closely at our notions of number we will see that in fact we have two different ways of conceiving of numbers The first is
More informationCreative Objectivism, a powerful alternative to Constructivism
Creative Objectivism, a powerful alternative to Constructivism Copyright c 2002 Paul P. Budnik Jr. Mountain Math Software All rights reserved Abstract It is problematic to allow reasoning about infinite
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More information@igorwhiletrue
Abstrakte Maschinen @igorwhiletrue Programming is hard Why? Link between our universe and computational universe Cellular automata are selfreplicating abstract machines Humans are selfreplicating biological
More informationON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936
ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM Turing 1936 Where are We? Ignoramus et ignorabimus Wir mussen wissen Wir werden wissen We do not know We shall not know We must know
More informationILP = Logic, CS, ML Stop counting, start reasoning
ILP = Logic, CS, ML Stop counting, start reasoning Gilles Richard AOC team The story so far Several actors K. Brouwer K. Godel J. Herbrand A. Colmerauer R. Kowalski S. Muggleton L. Brouwer (18811966)
More informationLecture Notes for MATH Mathematical Logic 1
Lecture Notes for MATH2040  Mathematical Logic 1 Michael Rathjen School of Mathematics University of Leeds Autumn 2009 Chapter 0. Introduction Maybe not all areas of human endeavour, but certainly the
More informationOpen access to the SEP is made possible by a worldwide funding initiative. Please Read How You Can Help Keep the Encyclopedia Free
1 of 9 27/04/2012 12:28 PM Open access to the SEP is made possible by a worldwide funding initiative. Set Theory First published Thu Jul 11, 2002 Please Read How You Can Help Keep the Encyclopedia Free
More informationENEE 459E/CMSC 498R Inclass exercise February 10, 2015
ENEE 459E/CMSC 498R Inclass exercise February 10, 2015 In this inclass exercise, we will explore what it means for a problem to be intractable (i.e. it cannot be solved by an efficient algorithm). There
More informationSyntax and Semantics. The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of:
Integer Arithmetic Syntax and Semantics The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of: function symbols +,,s (s is the successor
More informationNonclassical logics (Nichtklassische Logiken)
Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter
More informationA Semantics of Evidence for Classical Arithmetic
Thierry Coquand Chambery, June 5, 2009 Intuitionistic analysis of classical logic This work is motivated by the first consistency proof of arithmetic by Gentzen (1936) Unpublished by Gentzen (criticisms
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationLecture 13: Foundations of Math and Kolmogorov Complexity
6.045 Lecture 13: Foundations of Math and Kolmogorov Complexity 1 SelfReference and the Recursion Theorem 2 Lemma: There is a computable function q : Σ* Σ* such that for every string w, q(w) is the description
More informationReview: Stephen G. Simpson (1999) Subsystems of SecondOrder Arithmetic (Springer)
Review: Stephen G. Simpson (1999) Subsystems of SecondOrder Arithmetic (Springer) Jeffrey Ketland, February 4, 2000 During the nineteenth century, and up until around 1939, many major mathematicians were
More informationLogic and Computation
Logic and Computation CS245 Dr. Borzoo Bonakdarpour University of Waterloo (Fall 2012) Computability and Decidability Logic and Computation p. 1/29 Agenda Programs as Formulas Cantor s Diagonalization
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 13 CHAPTER 4 TURING MACHINES 1. The definition of Turing machine 2. Computing with Turing machines 3. Extensions of Turing
More informationMath 144 Summer 2012 (UCR) ProNotes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
More informationComputability Theory
Computability Theory Cristian S. Calude May 2012 Computability Theory 1 / 1 Bibliography M. Sipser. Introduction to the Theory of Computation, PWS 1997. (textbook) Computability Theory 2 / 1 Supplementary
More informationGeometry and Philosophy
Geometry and Philosophy Russell Marcus Hamilton College November 2007 Philosophy and Geometry, Slide 1 Plato s Academy Let no one ignorant of geometry enter here Philosophy and Geometry, Slide 2 The Big
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationTuring Centenary Lecture
Turing Centenary Lecture P.D.Welch University of Bristol Visiting Research Fellow, Isaac Newton Institute Early Life King s College 1931 King s College 1931 Hardy Eddington He attended Eddington s lectures
More informationCS154, Lecture 12: Kolmogorov Complexity: A Universal Theory of Data Compression
CS154, Lecture 12: Kolmogorov Complexity: A Universal Theory of Data Compression Rosencrantz & Guildenstern Are Dead (Tom Stoppard) Rigged Lottery? And the winning numbers are: 1, 2, 3, 4, 5, 6 But is
More informationFourteen Arguments in Favour of a Formalist Philosophy of Real Mathematics
Baltic J. Modern Computing, Vol. 3 (2015), No. 1, pp. 1 15 Fourteen Arguments in Favour of a Formalist Philosophy of Real Mathematics Karlis PODNIEKS University of Latvia, Raiņa bulvāris 19, Riga, LV1586,
More informationBetter Logic Through Algebra, Probability, and. Joseph W. Norman, M.D., Ph.D. University of Michigan, Ann Arbor
Better Logic Through Algebra,, and Joseph W. Norman, M.D., Ph.D. University of Michigan, Ann Arbor Association for Symbolic Logic 2012 Madison, Wisconsin Diversity Is the Savior of Logical Truth I. There
More informationThe Road from Leibniz to Turing, Part II
The Road from Leibniz to Turing, Part II DA2205, DD3001 October 11, 2012 Hilbert to the Rescue Source: Lecture material is based on The Universal Computer by Martin Davis Basic bio David Hilbert Born:
More informationDRAFT. Diagonalization. Chapter 4
Chapter 4 Diagonalization..the relativized P =?NP question has a positive answer for some oracles and a negative answer for other oracles. We feel that this is further evidence of the difficulty of the
More informationTuring Machines (TM) The Turing machine is the ultimate model of computation.
TURING MACHINES Turing Machines (TM) The Turing machine is the ultimate model of computation. Alan Turing (92 954), British mathematician/engineer and one of the most influential scientists of the last
More informationCSCE 551: ChinTser Huang. University of South Carolina
CSCE 551: Theory of Computation ChinTser Huang huangct@cse.sc.edu University of South Carolina ChurchTuring Thesis The definition of the algorithm came in the 1936 papers of Alonzo Church h and Alan
More informationComputational Complexity: A Modern Approach. Draft of a book: Dated January 2007 Comments welcome!
i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University complexitybook@gmail.com Not to be reproduced or distributed
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semidecidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationLecture 2: What is Proof?
Lecture 2: What is Proof? Math 295 08/26/16 Webster Proof and Its History 8/2016 1 / 1 Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct
More informationLogic as The Calculus of Computer Science
1 Ottobre, 2007 1 Università di Napoli Federico II What is a Logic? A Logic is a formalism with a sintax a semantics an inference mechanism for reasoning Historical Diagram The First Age of Logic: Symbolic
More informationLectures on Computational Type Theory
Lectures on Computational Type Theory From ProofsasPrograms to ProofsasProcesses Robert L. Constable Cornell University Lecture Schedule Lecture 1: Origins and Introduction to Computational Type Theory
More informationMATHEMATICS = SET THEORY? 1.1. Set theory. No one shall drive us out of the paradise that Cantor has created David Hilbert
CHAPTER 1 MATHEMATICS = SET THEORY? No one shall drive us out of the paradise that Cantor has created David Hilbert 1.1. Set theory The basic concept upon which the discipline known as set theory rests
More informationDecidability. William Chan
Decidability William Chan Preface : In 1928, David Hilbert gave a challenge known as the Entscheidungsproblem, which is German for Decision Problem. Hilbert s problem asked for some purely mechanical procedure
More informationComputational Logic. Davide Martinenghi. Spring Free University of BozenBolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of BozenBolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic  sequent calculus To overcome the problems of natural
More informationTuring s Approaches to Computability, Mathematical Reasoning and Intelligence
English translation of a revised version of: C. Cellucci, Gli approcci di Turing alla computabilità e all intelligenza, in T. Orlandi (ed.), Per il centenario di Turing, fondatore dell informatica, Accademia
More informationEPISTEMOLOGY, COMPUTATION AND THE LAWS OF PHYSICS
EPISTEMOLOGY, COMPUTATION AND THE LAWS OF PHYSICS David H. Wolpert NASA Ames Research Center David.H.Wolpert@nasa.gov http://ti.arc.nasa.gov/people/dhw/ Walter Read Mathematics Department, CS Fresno NASAARC030667
More informationChapter 2: Introduction to Propositional Logic
Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:
More informationThe λcalculus and Curry s Paradox Drew McDermott , revised
The λcalculus and Curry s Paradox Drew McDermott drew.mcdermott@yale.edu 20150923, revised 20151024 The λcalculus was invented by Alonzo Church, building on earlier work by Gottlob Frege and Moses
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationInterpretations. The first incompleteness theorem applies not only to the language of arithmetic but to
Interpretations The first incompleteness theorem applies not only to the language of arithmetic but to other languages into which one can translate the language of arithmetic. The notion of "translation"
More informationDEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION
DEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION NORBERT GRATZL University of Salzburg Abstract Definite descriptions are in the focus of philosophical discussion at least since Russell s famous
More informationFinal Exam Comments. UVa  cs302: Theory of Computation Spring < Total
UVa  cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More informationThe Arithmetic of Reasoning. Chessa Horomanski & Matt Corson
The Arithmetic of Reasoning LOGIC AND BOOLEAN ALGEBRA Chessa Horomanski & Matt Corson Computers Ask us questions, correct our grammar, calculate our taxes But Misunderstand what we re sure we told them,
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Nonclassical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationGödel s Incompleteness Theorem for Computer Users
Gödel s Incompleteness Theorem for Computer Users Stephen A. Fenner November 16, 2007 Abstract We sketch a short proof of Gödel s Incompleteness theorem, based on a few reasonably intuitive facts about
More informationAn Introduction to Modal Logic I
An Introduction to Modal Logic I Introduction and Historical remarks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 10 th 2013 Marco
More informationCS154, Lecture 10: Rice s Theorem, Oracle Machines
CS154, Lecture 10: Rice s Theorem, Oracle Machines Moral: Analyzing Programs is Really, Really Hard But can we more easily tell when some program analysis problem is undecidable? Problem 1 Undecidable
More informationThe logical structure of relativity theory
The logical structure of relativity theory Jesse Alama... AtLarge jessealama@yahoo.com Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences Reáltonda utca 13 15 H1053Budapest Advisers:
More informationPartial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic
Partial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic Zofia Adamowicz Institute of Mathematics, Polish Academy of Sciences Śniadeckich 8, 00950 Warszawa, Poland
More informationChapter 1. Introduction
Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.
More informationSeptember 13, Cemela Summer School. Mathematics as language. Fact or Metaphor? John T. Baldwin. Framing the issues. structures and languages
September 13, 2008 A Language of / for mathematics..., I interpret that mathematics is a language in a particular way, namely as a metaphor. David Pimm, Speaking Mathematically Alternatively Scientists,
More informationChapter 4. Basic Set Theory. 4.1 The Language of Set Theory
Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,
More informationSemantic tree method historical perspective and applications
nnales UMCS Informatica I 3 (2005) 1525 nnales UMCS Informatica LublinPolonia Sectio I http://www.annales.umcs.lublin.pl/ Semantic tree method historical perspective and applications Izabela BondeckaKrzykowska
More informationHenkin s Method and the Completeness Theorem
Henkin s Method and the Completeness Theorem Guram Bezhanishvili 1 Introduction Let L be a firstorder logic. For a sentence ϕ of L, we will use the standard notation ϕ for ϕ is provable in L (that is,
More information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 10 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 10 Nancy Lynch Today Final topic in computability theory: SelfReference and the Recursion
More informationLogic, Mathematics, and Computer Science
Logic, Mathematics, and Computer Science Yves Nievergelt Logic, Mathematics, and Computer Science Modern Foundations with Practical Applications Second Edition 123 Yves Nievergelt Department of Mathematics
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationhttp://jfratup.weebly.com/math19520162017.html MATH 195 Part 1 Science What is science? Formal Sciences Natural Sciences (physical sciences and life sciences) Social Sciences HISTORY Aristotle: Deductive
More informationLinear Algebra Fall mathx.kaist.ac.kr/~schoi/teaching.html.
Linear Algebra Fall 2013 mathx.kaist.ac.kr/~schoi/teaching.html. Course HPs klms.kaist.ac.kr: some announcements, can ask questions here, also link to my page. Also, grades for quizzes and exames. math.kaist.ac.kr/~schoi:
More informationLATTICE BASIS AND ENTROPY
LATTICE BASIS AND ENTROPY Vinod Kumar.P.B 1 and K.Babu Joseph 2 Dept. of Mathematics Rajagiri School of Engineering & Technology Rajagiri Valley.P.O, Cochin 682039 Kerala, India. ABSTRACT: We introduce
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationThis section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.
1.10. BASICS CONCEPTS OF SET THEORY 193 1.10 Basics Concepts of Set Theory Having learned some fundamental notions of logic, it is now a good place before proceeding to more interesting things, such as
More informationALGORITHMIC INFORMATION THEORY AND UNDECIDABILITY
PANU RAATIKAINEN ALGORITHMIC INFORMATION THEORY AND UNDECIDABILITY 1. INTRODUCTION Algorithmic information theory, or the theory of Kolmogorov complexity, has become an extraordinarily popular theory,
More informationCOMPUTER SCIENCE. Computer Science. 15. Turing Machines. Computer Science. An Interdisciplinary Approach. Section 7.4.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 7.4 ROBERT SEDGEWICK
More informationModel theory. Anand Pillay University of Leeds. July 17, 2010
Model theory Anand Pillay University of Leeds July 17, 2010 1 Introduction Contemporary or modern (mathematical) logic was born at the end of the 19th century. Its origin is connected with mathematics
More informationA Structuralist Account of Logic
Croatian Journal of Philosophy Vol. VIII, No. 23, 2008 Majda Trobok, Department of Philosophy University of Rijeka A Structuralist Account of Logic The lynchpin of the structuralist account of logic endorsed
More informationA skeptical history of numbers
A sketical history of numbers Curtis T McMullen Harvard University Number theory Algebra Whole numbers and so on Solve a x2 + b x + c = 0. N = {0, 1, 2, 3,...} x= b± 820 AD Muḥammad ibn Mūsā alkhwārizmī
More informationComputational Logic. Davide Martinenghi. Spring Free University of BozenBolzano. Computational Logic Davide Martinenghi (1/26)
Computational Logic Davide Martinenghi Free University of BozenBolzano Spring 2010 Computational Logic Davide Martinenghi (1/26) Propositional Logic  algorithms Complete calculi for deciding logical
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21stcentury mathematician would differ greatly
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationComputational Logic. Recall of FirstOrder Logic. Damiano Zanardini
Computational Logic Recall of FirstOrder Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic
More informationGödel Numbering. Substitute {x: x is not an element of itself} for y, and we get a contradiction:
Gödel Numbering {x: x is a horse} is a collection that has all the worlds horses as elements, and nothing else. Thus we have For any y, y 0 {x: x is a horse} if and only if y is a horse. Traveler, for
More informationWe introduce one more operation on sets, perhaps the most important
11. The power set Please accept my resignation. I don t want to belong to any club that will accept me as a member. Groucho Marx We introduce one more operation on sets, perhaps the most important one:
More informationKolmogorov complexity and its applications
Spring, 2009 Kolmogorov complexity and its applications Paul Vitanyi Computer Science University of Amsterdam http://www.cwi.nl/~paulv/coursekc We live in an information society. Information science is
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More information7.1 The Origin of Computer Science
CS125 Lecture 7 Fall 2016 7.1 The Origin of Computer Science Alan Mathison Turing (1912 1954) turing.jpg 170!201 pixels On Computable Numbers, with an Application to the Entscheidungsproblem 1936 1936:
More informationSTRUCTURAL PROOF THEORY: Uncovering capacities of the mathematical mind
STRUCTURAL PROOF THEORY: Uncovering capacities of the mathematical mind Wilfried Sieg Carnegie Mellon University Introduction. In one of his last published notes, Gödel claimed that Turing had committed
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More information