Frege-numbers + Begriffsschrift revisited

Similar documents
The Foundations of Mathematics. Frege s Logicism

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

Frege s Proofs of the Axioms of Arithmetic

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

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

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

Axiomatic set theory. Chapter Why axiomatic set theory?

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

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

CHAPTER 11. Introduction to Intuitionistic Logic

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

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

1 Completeness Theorem for First Order Logic

INTERNAL AND EXTERNAL LOGIC

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

A Logically Coherent Ante Rem Structuralism

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

Part II Logic and Set Theory

Introduction to Metalogic 1

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

Reflexives and non-fregean quantifiers

Introduction to Metalogic

Gödel s Incompleteness Theorems

Russell s logicism. Jeff Speaks. September 26, 2007

Introduction to Metalogic

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

Foundations of Mathematics Worksheet 2

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

Philosophy of Mathematics Intuitionism

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

Informal Statement Calculus

Abstraction and Identity

1.1 Language and Logic

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

About the relationship between formal logic and complexity classes

MATH 1090 Problem Set #3 Solutions March York University

T Reactive Systems: Temporal Logic LTL

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

(Im)predicativity and Fregean arithmetic

Frege s Recipe. February 23, 2016

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

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

The predicate calculus is complete

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Class 29 - November 3 Semantics for Predicate Logic

Die Grundlagen der Arithmetik 82 83

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

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

Lecture 11: Measuring the Complexity of Proofs

Logic and Mathematics:

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

The Syntax of First-Order Logic. Marc Hoyois

17.1 The Halting Problem

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

The paradox of knowability, the knower, and the believer

Classical Propositional Logic

5. Peano arithmetic and Gödel s incompleteness theorem

cse541 LOGIC FOR COMPUTER SCIENCE

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

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

Timo Latvala. February 4, 2004

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

arxiv: v1 [math.lo] 7 Dec 2017

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

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

A Height-Potentialist View of Set Theory

Basic Algebraic Logic

Turing Centenary Lecture

From Foundations to Philosophy of Mathematics

COMP4418: Knowledge Representation and Reasoning First-Order Logic

A Structuralist Account of Logic

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

First-Order Logic. Chapter Overview Syntax

An Intuitively Complete Analysis of Gödel s Incompleteness

Philosophy 220. Truth-Functional Equivalence and Consistency

Lecture 16: Computation Tree Logic (CTL)

KLEENE LOGIC AND INFERENCE

(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.1 Language and Logic

i. identifying abstracts in grundlagen

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

Decidability: Church-Turing Thesis

03 Review of First-Order Logic

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

Logic: Propositional Logic Truth Tables

the logic of provability

On some Metatheorems about FOL

G52DOA - Derivation of Algorithms Predicate Logic

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

Chapter 4: Classical Propositional Semantics

Semantics and Pragmatics of NLP

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

02 Propositional Logic

Kripke on Frege on Sense and Reference. David Chalmers

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

Introduction to Sets and Logic (MATH 1190)

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

SOCRATES DID IT BEFORE GÖDEL

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

Realism and Idealism External Realism

Transcription:

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

Grundlagen der Arithmetik: some philosophical issues Introduction:

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

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;

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;

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."

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.

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?

Numerical quantifiers

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

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

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

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

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."

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))

The Julius Caesar-problem: numbers as objects

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."

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.

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).

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.

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.

The Hume Principle

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)

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)))

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.

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).

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 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.

Frege numbers

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

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

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)

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))

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).

Frege numbers, continuation

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)))

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

Theorems about Frege numbers

Theorems about Frege numbers The Hume principle holds.

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

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

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))

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.

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.

Function and Concept: semantical values

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

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).

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.

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.

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.

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.