Frege-numbers + Begriffsschrift revisited

Size: px
Start display at page:

Download "Frege-numbers + Begriffsschrift revisited"

Transcription

1 History of logic: from Frege to Gödel 26th September 2017

2 Grundlagen der Arithmetik: some philosophical issues Introduction:

3 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles:

4 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles: There must be a sharp separation of the psychological from the logical, the subjective from the objective;

5 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles: There must be a sharp separation of the psychological from the logical, the subjective from the objective; The meaning of a word must be asked for in the context of a proposition, not in isolation;

6 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles: There must be a sharp separation of the psychological from the logical, the subjective from the objective; The meaning of a word must be asked for in the context of a proposition, not in isolation; The distinction between concept and object must be kept in mind."

7 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles: There must be a sharp separation of the psychological from the logical, the subjective from the objective; The meaning of a word must be asked for in the context of a proposition, not in isolation; The distinction between concept and object must be kept in mind." Numbers are neither physical nor mental objects.

8 Grundlagen der Arithmetik: some philosophical issues Introduction: "In this investigation I have adhered to the following fundamental principles: There must be a sharp separation of the psychological from the logical, the subjective from the objective; The meaning of a word must be asked for in the context of a proposition, not in isolation; The distinction between concept and object must be kept in mind." Numbers are neither physical nor mental objects. But how is it possible to know about numbers and their properties?

9 Numerical quantifiers

10 Numerical quantifiers Numerals used to settle the number of certain objects are second-level concepts.

11 Numerical quantifiers Numerals used to settle the number of certain objects belonging under a certain concept are second-level concepts.

12 Numerical quantifiers Numerals used to settle the number of certain objects belonging under a certain concept are second-level concepts. The Fregean use of the numeral n: The number n belongs to the concept F

13 Numerical quantifiers Numerals used to settle the number of certain objects belonging under a certain concept are second-level concepts. The Fregean use of the numeral n: The number n belongs to the concept F "... the number 0 belongs to a concept if, whatever a may be, the proposition holds universally that a does not fall under that concept. " 0 x(fx) x Fx

14 Numerical quantifiers Numerals used to settle the number of certain objects belonging under a certain concept are second-level concepts. The Fregean use of the numeral n: The number n belongs to the concept F "... the number 0 belongs to a concept if, whatever a may be, the proposition holds universally that a does not fall under that concept. " 0 x(fx) x Fx "the number (n + 1) belongs to the concept F if there is an object a falling under F such mat the number n belongs to the concept falling under F, but not a."

15 Numerical quantifiers Numerals used to settle the number of certain objects belonging under a certain concept are second-level concepts. The Fregean use of the numeral n: The number n belongs to the concept F "... the number 0 belongs to a concept if, whatever a may be, the proposition holds universally that a does not fall under that concept. " 0 x(fx) x Fx "the number (n + 1) belongs to the concept F if there is an object a falling under F such mat the number n belongs to the concept falling under F, but not a." n+1 x(fx) a(fa n x(fx x a))

16 The Julius Caesar-problem: numbers as objects

17 The Julius Caesar-problem: numbers as objects "... we can never... decide by means of our definitions whether the number Julius Caesar belongs to a concept, or whether that well-known conqueror of Gaul is a number or not."

18 The Julius Caesar-problem: numbers as objects "... we can never... decide by means of our definitions whether the number Julius Caesar belongs to a concept, or whether that well-known conqueror of Gaul is a number or not." Background assumption: numbers are objects, moreover, unique objects.

19 The Julius Caesar-problem: numbers as objects "... we can never... decide by means of our definitions whether the number Julius Caesar belongs to a concept, or whether that well-known conqueror of Gaul is a number or not." Background assumption: numbers are objects, moreover, unique objects. Numbers are objects that are not given by intuition; they are given by reason (pace Kant).

20 The Julius Caesar-problem: numbers as objects "... we can never... decide by means of our definitions whether the number Julius Caesar belongs to a concept, or whether that well-known conqueror of Gaul is a number or not." Background assumption: numbers are objects, moreover, unique objects. Numbers are objects that are not given by intuition; they are given by reason (pace Kant). Their objectivity lies solely in the fact that there are true propositions about them.

21 The Julius Caesar-problem: numbers as objects "... we can never... decide by means of our definitions whether the number Julius Caesar belongs to a concept, or whether that well-known conqueror of Gaul is a number or not." Background assumption: numbers are objects, moreover, unique objects. Numbers are objects that are not given by intuition; they are given by reason (pace Kant). Their objectivity lies solely in the fact that there are true propositions about them. We should posit the recognition conditions for numbers; that s all that we can and should do.

22 The Hume Principle

23 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume)

24 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume) #F = #G f( x(fx 1 y(f(x, y) Gy) y(gy 1 x(fx f(x, y)))

25 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume) #F = #G f( x(fx 1 y(f(x, y) Gy) y(gy 1 x(fx f(x, y))) Short for the right side: F G, F is equinumerous with G.

26 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume) #F = #G f( x(fx 1 y(f(x, y) Gy) y(gy 1 x(fx f(x, y))) Short for the right side: F G, F is equinumerous with G. An abstraction principle (based on an equivalence relation).

27 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume) #F = #G f( x(fx 1 y(f(x, y) Gy) y(gy 1 x(fx f(x, y))) Short for the right side: F G, F is equinumerous with G. An abstraction principle (based on an equivalence relation). Equivalence classes are proper classes.

28 The Hume Principle When two numbers are so combined, as that the one has always a unit answering to every unit of the other, we pronounce them equal (quoted from Hume) #F = #G f( x(fx 1 y(f(x, y) Gy) y(gy 1 x(fx f(x, y))) Short for the right side: F G, F is equinumerous with G. An abstraction principle (based on an equivalence relation). Equivalence classes are proper classes. The principle is impredicative: the domains of quantification for x and y contain the objects to be defined.

29 Frege numbers

30 Frege numbers The number belonging to the concept F: #F = Ĝ(F G)

31 Frege numbers The number belonging to the concept F: #F = Ĝ(F G) Ĝ: the extension of the concept G

32 Frege numbers The number belonging to the concept F: #F = Ĝ(F G) Ĝ: the extension of the concept G n is a number (solution to the Julius Caesar problem): n F(n = #F)

33 Frege numbers The number belonging to the concept F: #F = Ĝ(F G) Ĝ: the extension of the concept G n is a number (solution to the Julius Caesar problem): n F(n = #F) 0 is the number belonging to the concept not equal with itself : 0 = #(λx(x x))

34 Frege numbers The number belonging to the concept F: #F = Ĝ(F G) Ĝ: the extension of the concept G n is a number (solution to the Julius Caesar problem): n F(n = #F) 0 is the number belonging to the concept not equal with itself : 0 = #(λx(x x)) λxa(x): the concept described by the open sentence A(x).

35 Frege numbers, continuation

36 Frege numbers, continuation m is an immediate follower of n in the sequence of numbers: mpn F G a(m = #G n = #F Ga x(fx (Ga x a)))

37 Frege numbers, continuation m is an immediate follower of n in the sequence of numbers: mpn F G a(m = #G n = #F Ga x(fx (Ga x a))) n is a finite (or natural) number iff it follows 0 in the P-sequence of numbers (see Begriffsschrift, ch. 3): n 0P n

38 Theorems about Frege numbers

39 Theorems about Frege numbers The Hume principle holds.

40 Theorems about Frege numbers The Hume principle holds. The number belonging to the concept equal with 0 is an immediate follower of 0: (#λx(x = 0))P0

41 Theorems about Frege numbers The Hume principle holds. The number belonging to the concept equal with 0 is an immediate follower of 0: P is one-to-one. (#λx(x = 0))P0

42 Theorems about Frege numbers The Hume principle holds. The number belonging to the concept equal with 0 is an immediate follower of 0: P is one-to-one. (#λx(x = 0))P0 Every number except of 0 is an immediate follower of some number: n(( n n 0) m(npm))

43 Theorems about Frege numbers The Hume principle holds. The number belonging to the concept equal with 0 is an immediate follower of 0: P is one-to-one. (#λx(x = 0))P0 Every number except of 0 is an immediate follower of some number: n(( n n 0) m(npm)) If n is a natural number, then the number belonging to the concept belonging to the P-sequence beginning with 0 and finishing with n is an immediate follower of n and it is different from n.

44 Theorems about Frege numbers The Hume principle holds. The number belonging to the concept equal with 0 is an immediate follower of 0: P is one-to-one. (#λx(x = 0))P0 Every number except of 0 is an immediate follower of some number: n(( n n 0) m(npm)) If n is a natural number, then the number belonging to the concept belonging to the P-sequence beginning with 0 and finishing with n is an immediate follower of n and it is different from n. "Frege s Theorem": the Frege numbers satisfy the Peano axioms.

45 Function and Concept: semantical values

46 Function and Concept: semantical values Truth values: True and False, ideal objects.

47 Function and Concept: semantical values Truth values: True and False, ideal objects. Complete expressions of the language: names and sentences. They denote objects (sentences denote truth values).

48 Function and Concept: semantical values Truth values: True and False, ideal objects. Complete expressions of the language: names and sentences. They denote objects (sentences denote truth values). Incomplete expressions of the language refer to functions. An expression G with one empty place refers to the function that for each expression F which can fill the empty place renders the denotatum of the completed expression G(F) to the reference of F.

49 Function and Concept: semantical values Truth values: True and False, ideal objects. Complete expressions of the language: names and sentences. They denote objects (sentences denote truth values). Incomplete expressions of the language refer to functions. An expression G with one empty place refers to the function that for each expression F which can fill the empty place renders the denotatum of the completed expression G(F) to the reference of F. Each function has a value range. Two functions have the same value range iff they give the same output value for identical input values.

50 Function and Concept: semantical values Truth values: True and False, ideal objects. Complete expressions of the language: names and sentences. They denote objects (sentences denote truth values). Incomplete expressions of the language refer to functions. An expression G with one empty place refers to the function that for each expression F which can fill the empty place renders the denotatum of the completed expression G(F) to the reference of F. Each function has a value range. Two functions have the same value range iff they give the same output value for identical input values. Concepts are functions whose values are all and only truth values. Extension of a concept is its value range.

51 Function and Concept: semantical values Truth values: True and False, ideal objects. Complete expressions of the language: names and sentences. They denote objects (sentences denote truth values). Incomplete expressions of the language refer to functions. An expression G with one empty place refers to the function that for each expression F which can fill the empty place renders the denotatum of the completed expression G(F) to the reference of F. Each function has a value range. Two functions have the same value range iff they give the same output value for identical input values. Concepts are functions whose values are all and only truth values. Extension of a concept is its value range. Logical connectives are (truth) function expressions, and the horizontal stroke ("content stroke") of the Begriffsschrift refers to a truth function, too.

The Foundations of Mathematics. Frege s Logicism

The Foundations of Mathematics. Frege s Logicism The Foundations of Mathematics Lecture One Frege s Logicism Rob Trueman rob.trueman@york.ac.uk University of York Preliminaries Frege s Logicism Preliminaries Mathematics versus Logic Hume s Principle

More information

Frege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy)

Frege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy) 1 Frege: Logical objects by abstraction and their criteria of identity Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy) Abstraction à la Frege A schema for a Fregean abstraction

More information

Frege s Proofs of the Axioms of Arithmetic

Frege s Proofs of the Axioms of Arithmetic Frege s Proofs of the Axioms of Arithmetic Richard G. Heck, Jr. 1 The Dedekind-Peano Axioms for Arithmetic 1. N0 2. x(nx y.p xy) 3(a). x y z(nx P xy P xy y = z) 3(b). x y z(nx Ny P xz P yz x = y) 4. z(nz

More information

All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates

All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is

More information

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical

More information

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms Philosophy 5340 Epistemology Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms Part 2: Theoretical Terms 1. What Apparatus Is Available for Carrying out Analyses?

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

Notes on Frege s Grundlagen Stathis Psillos 9/3/2005 Logical investigation of the fine structure of the concept of number

Notes on Frege s Grundlagen Stathis Psillos 9/3/2005 Logical investigation of the fine structure of the concept of number Notes on Frege s Grundlagen 55-76 Stathis Psillos 9/3/2005 Logical investigation of the fine structure of the concept of number Three Fundamental Principles 1) Always to separate sharply the psychological

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 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 information

Motivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory

Motivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory Motivation CS389L: Automated Logical Reasoning Lecture 10: Overview of First-Order Theories Işıl Dillig Last few lectures: Full first-order logic In FOL, functions/predicates are uninterpreted (i.e., structure

More information

Gödel in class. Achim Feldmeier Brno - Oct 2010

Gödel in class. Achim Feldmeier Brno - Oct 2010 Gödel in class Achim Feldmeier Brno - Oct 2010 Philosophy lost key competence to specialized disciplines: right life (happyness, morals) Christianity science and technology Natural Sciences social issues

More information

1 Completeness Theorem for First Order Logic

1 Completeness Theorem for First Order Logic 1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical

More information

INTERNAL AND EXTERNAL LOGIC

INTERNAL AND EXTERNAL LOGIC Bulletin of the Section of Logic Volume 17:3/4 (1988) pp. 170 176 reedition 2005 [original edition pp. 170 181] V. A. Smirnov INTERNAL AND EXTERNAL LOGIC In an essential way I make use of Frege s and Vasilev

More information

First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms

First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO

More information

A Logically Coherent Ante Rem Structuralism

A Logically Coherent Ante Rem Structuralism A Logically Coherent Ante Rem Structuralism Edward N. Zalta CSLI, Stanford University zalta@stanford.edu http://mally.stanford.edu/zalta.html and Uri Nodelman CSLI, Stanford University nodelman@stanford.edu

More information

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March

More information

Part II Logic and Set Theory

Part II Logic and Set Theory Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Introduction to Metalogic 1

Introduction to Metalogic 1 Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,

More information

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Valentine Kabanets October 27, 2016 1 Gödel s Second Incompleteness Theorem 1.1 Consistency We say that a proof system P is consistent

More information

Reflexives and non-fregean quantifiers

Reflexives and non-fregean quantifiers UCLA Working Papers in Linguistics, Theories of Everything Volume 17, Article 49: 439-445, 2012 Reflexives and non-fregean quantifiers Richard Zuber It is shown that depending on the subject noun phrase

More information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

Gödel s Incompleteness Theorems

Gödel s Incompleteness Theorems Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell 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 information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

EXP. LOGIC: M.Ziegler PSPACE. NPcomplete. School of Computing PSPACE CH #P PH. Martin Ziegler 박세원신승우조준희 ( 박찬수 ) complete. co- P NP. Re a ) Computation

EXP. LOGIC: M.Ziegler PSPACE. NPcomplete. School of Computing PSPACE CH #P PH. Martin Ziegler 박세원신승우조준희 ( 박찬수 ) complete. co- P NP. Re a ) Computation EXP PSPACE complete PSPACE CH #P PH conpcomplete NPcomplete co- NP P NP P L NP School of Computing Martin Ziegler 박세원신승우조준희 ( 박찬수 ) Complexity and Re a ) Computation Please ask questions! Informal Logic

More information

Foundations of Mathematics Worksheet 2

Foundations of Mathematics Worksheet 2 Foundations of Mathematics Worksheet 2 L. Pedro Poitevin June 24, 2007 1. What are the atomic truth assignments on {a 1,..., a n } that satisfy: (a) The proposition p = ((a 1 a 2 ) (a 2 a 3 ) (a n 1 a

More information

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,

More information

Philosophy of Mathematics Intuitionism

Philosophy of Mathematics Intuitionism Philosophy of Mathematics Intuitionism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 01/12/15 Classical mathematics Consider the Pythagorean argument that 2 is irrational: 1. Assume that

More information

by Yurii Khomskii There is a weaker notion called semi-representability:

by Yurii Khomskii There is a weaker notion called semi-representability: Gödel s Incompleteness Theorem by Yurii Khomskii We give three different proofs of Gödel s First Incompleteness Theorem. All three proofs are essentially variations of one another, but some people may

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

Abstraction and Identity

Abstraction and Identity Abstraction and Identity [forthcoming in Dialectica] Roy T. Cook & Philip A. Ebert November 25, 2004 1 Introduction Over the last 20 years there has been a resurrection of a position in the philosophy

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

About the relationship between formal logic and complexity classes

About the relationship between formal logic and complexity classes About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular

More information

MATH 1090 Problem Set #3 Solutions March York University

MATH 1090 Problem Set #3 Solutions March York University York University Faculties of Science and Engineering, Arts, Atkinson MATH 1090. Problem Set #3 Solutions Section M 1. Use Resolution (possibly in combination with the Deduction Theorem, Implication as

More information

T Reactive Systems: Temporal Logic LTL

T Reactive Systems: Temporal Logic LTL Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most

More information

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It

More information

(Im)predicativity and Fregean arithmetic

(Im)predicativity and Fregean arithmetic (Im)predicativity and Fregean arithmetic Fernando Ferreira Universidade de Lisboa Journées sur les Arithmétiques Faibles 33 University of Gothenburg June 16-18, 2014 Frege s alertness As far as I can see,

More information

Frege s Recipe. February 23, 2016

Frege s Recipe. February 23, 2016 This is the peer-reviewed version of the following article: Cook RT & Ebert PA (2016) Frege's Recipe, Journal of Philosophy, 113 (7), pp. 309-345, which has been published in final form at https://doi.org/10.5840/jphil2016113721.

More information

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability 16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of

More information

Great Philosophers Gottlob Frege Evening lecture series, Department of Philosophy. Dr. Keith Begley 16/10/2018

Great Philosophers Gottlob Frege Evening lecture series, Department of Philosophy. Dr. Keith Begley 16/10/2018 Great Philosophers Gottlob Frege Evening lecture series, Department of Philosophy Dr. Keith Begley kbegley@tcd.ie 16/10/2018 Overview Early Life and Education Begriffsschrift (Conceptual Notation) Logicism

More information

The predicate calculus is complete

The predicate calculus is complete The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Class 29 - November 3 Semantics for Predicate Logic

Class 29 - November 3 Semantics for Predicate Logic Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory

More information

Die Grundlagen der Arithmetik 82 83

Die Grundlagen der Arithmetik 82 83 Die Grundlagen der Arithmetik 82 83 George S. Boolos and Richard G. Heck, Jr. Reductions of arithmetic, whether to set theory or to a theory formulated in a higher-order logic, must prove the infinity

More information

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1 Truthmaker Maximalism defended again 1 Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1. Truthmaker Maximalism is the thesis that every truth has a truthmaker. Milne (2005) attempts to refute it using

More information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

Lecture 11: Measuring the Complexity of Proofs

Lecture 11: Measuring the Complexity of Proofs IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July

More information

Logic and Mathematics:

Logic and Mathematics: Logic and Mathematics: Mathematicians in Schools Program Lashi Bandara Mathematical Sciences Institute, Australian National University April 21, 2011 Contents 1 Russell s Paradox 1 2 Propositional Logic

More information

Gödel s Incompleteness Theorems by Sally Cockburn (2016)

Gödel s Incompleteness Theorems by Sally Cockburn (2016) Gödel s Incompleteness Theorems by Sally Cockburn (2016) 1 Gödel Numbering We begin with Peano s axioms for the arithmetic of the natural numbers (ie number theory): (1) Zero is a natural number (2) Every

More information

The Syntax of First-Order Logic. Marc Hoyois

The Syntax of First-Order Logic. Marc Hoyois The Syntax of First-Order Logic Marc Hoyois Table of Contents Introduction 3 I First-Order Theories 5 1 Formal systems............................................. 5 2 First-order languages and theories..................................

More information

17.1 The Halting Problem

17.1 The Halting Problem CS125 Lecture 17 Fall 2016 17.1 The Halting Problem Consider the HALTING PROBLEM (HALT TM ): Given a TM M and w, does M halt on input w? Theorem 17.1 HALT TM is undecidable. Suppose HALT TM = { M,w : M

More information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

The paradox of knowability, the knower, and the believer

The paradox of knowability, the knower, and the believer The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals

More information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

5. Peano arithmetic and Gödel s incompleteness theorem

5. Peano arithmetic and Gödel s incompleteness theorem 5. Peano arithmetic and Gödel s incompleteness theorem In this chapter we give the proof of Gödel s incompleteness theorem, modulo technical details treated in subsequent chapters. The incompleteness theorem

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM Notre Dame Journal of Formal Logic Volume 41, Number 1, 2000 NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM HILARY PUTNAM Abstract This lecture, given at Beijing University in 1984, presents

More information

Computational Logic. Recall of First-Order Logic. Damiano Zanardini

Computational Logic. Recall of First-Order Logic. Damiano Zanardini Computational Logic Recall of First-Order Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic

More information

Timo Latvala. February 4, 2004

Timo Latvala. February 4, 2004 Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism

More information

Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1

Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1 Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don t want to just find a model, but want to know what

More information

arxiv: v1 [math.lo] 7 Dec 2017

arxiv: v1 [math.lo] 7 Dec 2017 CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive

More information

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1 Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of

More information

MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION

MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION Helge Rückert Department of Philosophy University of Saarbrücken, Germany Abstract: According to Kripke

More information

A Height-Potentialist View of Set Theory

A Height-Potentialist View of Set Theory A Height-Potentialist View of Set Theory Geoffrey Hellman September, 2015 SoTFoM Vienna 1 The Modal-Structural Framework Background logic: S5 quantified modal logic with secondorder or plurals logic, without

More information

Basic Algebraic Logic

Basic Algebraic Logic ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings

More information

Turing Centenary Lecture

Turing 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 information

From Foundations to Philosophy of Mathematics

From Foundations to Philosophy of Mathematics From Foundations to Philosophy of Mathematics From Foundations to Philosophy of Mathematics: An Historical Account of their Development in the XX Century and Beyond By Joan Roselló From Foundations to

More information

COMP4418: Knowledge Representation and Reasoning First-Order Logic

COMP4418: Knowledge Representation and Reasoning First-Order Logic COMP4418: Knowledge Representation and Reasoning First-Order Logic Maurice Pagnucco School of Computer Science and Engineering University of New South Wales NSW 2052, AUSTRALIA morri@cse.unsw.edu.au COMP4418

More information

A Structuralist Account of Logic

A 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 lynch-pin of the structuralist account of logic endorsed

More information

Syntax and Semantics. The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of:

Syntax 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 information

First-Order Logic. Chapter Overview Syntax

First-Order Logic. Chapter Overview Syntax Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts

More information

An Intuitively Complete Analysis of Gödel s Incompleteness

An Intuitively Complete Analysis of Gödel s Incompleteness An Intuitively Complete Analysis of Gödel s Incompleteness JASON W. STEINMETZ (Self-funded) A detailed and rigorous analysis of Gödel s proof of his first incompleteness theorem is presented. The purpose

More information

Philosophy 220. Truth-Functional Equivalence and Consistency

Philosophy 220. Truth-Functional Equivalence and Consistency Philosophy 220 Truth-Functional Equivalence and Consistency Review Logical equivalency: The members of a pair of sentences [of natural language] are logically equivalent if and only if it is not [logically]

More information

Lecture 16: Computation Tree Logic (CTL)

Lecture 16: Computation Tree Logic (CTL) Lecture 16: Computation Tree Logic (CTL) 1 Programme for the upcoming lectures Introducing CTL Basic Algorithms for CTL CTL and Fairness; computing strongly connected components Basic Decision Diagrams

More information

KLEENE LOGIC AND INFERENCE

KLEENE LOGIC AND INFERENCE Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The

More information

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M 1.3 Set Theory I As long as the terms of a mathematical theory are names of concrete objects as concrete as mothers breast, the very first object that received a name in human languages - there is not

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

i. identifying abstracts in grundlagen

i. identifying abstracts in grundlagen 1 Frege s Recipe 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 This paper has three aims: first, we present a formal recipe that Frege followed in his magnum opus Grundgesetze der Arithmetik

More information

Relations. Carl Pollard. October 11, Department of Linguistics Ohio State University

Relations. Carl Pollard. October 11, Department of Linguistics Ohio State University Department of Linguistics Ohio State University October 11, 2011 (Intuitive Idea) Intuitively, a relation is the kind of thing that either holds or doesn t hold between certain things. Examples: Being

More information

Decidability: Church-Turing Thesis

Decidability: Church-Turing Thesis Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there

More information

03 Review of First-Order Logic

03 Review of First-Order Logic CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of

More information

AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2

AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 45 Kragujevac J. Math. 33 (2010) 45 62. AN EXTENSION OF THE PROBABILITY LOGIC LP P 2 Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 1 University of Kragujevac, Faculty of Science,

More information

Logic: Propositional Logic Truth Tables

Logic: Propositional Logic Truth Tables Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06

More information

the logic of provability

the logic of provability A bird s eye view on the logic of provability Rineke Verbrugge, Institute of Artificial Intelligence, University of Groningen Annual Meet on Logic and its Applications, Calcutta Logic Circle, Kolkata,

More information

On some Metatheorems about FOL

On some Metatheorems about FOL On some Metatheorems about FOL February 25, 2014 Here I sketch a number of results and their proofs as a kind of abstract of the same items that are scattered in chapters 5 and 6 in the textbook. You notice

More information

G52DOA - Derivation of Algorithms Predicate Logic

G52DOA - Derivation of Algorithms Predicate Logic G52DOA - Derivation of Algorithms Predicate Logic Venanzio Capretta Predicate Logic So far, we studied propositional logic, in which we started with unspecified propositional variables A, B, C, and combined

More information

First-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig

First-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Semantics and Pragmatics of NLP

Semantics and Pragmatics of NLP Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL

More information

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)

More information

02 Propositional Logic

02 Propositional Logic SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or

More information

Kripke on Frege on Sense and Reference. David Chalmers

Kripke on Frege on Sense and Reference. David Chalmers Kripke on Frege on Sense and Reference David Chalmers Kripke s Frege Kripke s Frege Theory of Sense and Reference: Some Exegetical Notes Focuses on Frege on the hierarchy of senses and on the senses of

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

Compositionality Problems and How to Solve Them Thomas Ede Zimmermann, Goethe-Universität Frankfurt Hyderabad CogSci Colloquium, March 09

Compositionality Problems and How to Solve Them Thomas Ede Zimmermann, Goethe-Universität Frankfurt Hyderabad CogSci Colloquium, March 09 Compositionality Problems and How to Solve Them Thomas Ede Zimmermann, Goethe-Universität Frankfurt Hyderabad CogSci Colloquium, March 09 1. Compositionality Generalised Principle of Compositionality cf.

More information

SOCRATES DID IT BEFORE GÖDEL

SOCRATES DID IT BEFORE GÖDEL Logic and Logical Philosophy Volume 20 (2011), 205 214 DOI: 10.12775/LLP.2011.011 Josef Wolfgang Degen SOCRATES DID IT BEFORE GÖDEL Abstract. We translate Socrates famous saying I know that I know nothing

More information

Steeple #3: Goodstein s Theorem (glimpse only!)

Steeple #3: Goodstein s Theorem (glimpse only!) Steeple #3: Goodstein s Theorem (glimpse only!) Selmer Bringsjord (with Naveen Sundar G.) Are Humans Rational? v of 12717 RPI Troy NY USA Back to the beginning Back to the beginning Main Claim Back to

More information

Realism and Idealism External Realism

Realism and Idealism External Realism Realism and Idealism External Realism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 8/10/15 What is metaphysics? Metaphysics is the attempt to: give a general description of the whole of

More information