Kant and Finitism. Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy. Bill Tait. 4 June 2016

Similar documents
Between proof theory and model theory Three traditions in logic: Syntactic (formal deduction)

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

Russell s logicism. Jeff Speaks. September 26, 2007

Philosophy of Mathematics Intuitionism

Hilbert and the concept of axiom

Geometry and Philosophy

The logic of Σ formulas

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

Representability of Recursive Functions

Interpreting classical theories in constructive ones

Introduction to Metalogic

Proving Completeness for Nested Sequent Calculi 1

Cogito ergo sum non machina!

CONSERVATION by Harvey M. Friedman September 24, 1999

9th and 10th Grade Math Proficiency Objectives Strand One: Number Sense and Operations

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

The central problem: what are the objects of geometry? Answer 1: Perceptible objects with shape. Answer 2: Abstractions, mere shapes.

Math 414, Fall 2016, Test I

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

Axiomatic set theory. Chapter Why axiomatic set theory?

Geometry I (CM122A, 5CCM122B, 4CCM122A)

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

FINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS

CHAPTER 1. Introduction

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

A Super Introduction to Reverse Mathematics

Lecture 1: Axioms and Models

MATH 318/Fall, 2007 Notes on reading formulas and Skolem functions

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Propositional Logic: Syntax

Chapter One. The Real Number System

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

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

The Absoluteness of Constructibility

Propositional Logic Review

Arithmetical classification of the set of all provably recursive functions

Logic. Propositional Logic: Syntax

1. Introduction to commutative rings and fields

COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS

Indicative conditionals

DYNAMICS ON THE CIRCLE I

Part II. Logic and Set Theory. Year

Final Exam (100 points)

There are infinitely many set variables, X 0, X 1,..., each of which is

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Semantic methods in proof theory. Jeremy Avigad. Department of Philosophy. Carnegie Mellon University.

An Intuitively Complete Analysis of Gödel s Incompleteness

From Constructibility and Absoluteness to Computability and Domain Independence

This paper is also taken by Combined Studies Students. Optional Subject (i): Set Theory and Further Logic

Lecture 11: Minimal types

Mathematics 3210 Spring Semester, 2005 Homework notes, part 8 April 15, 2005

FACTORIZATION AND THE PRIMES

A NOTE ON ARITHMETIC IN FINITE TYPES. 1. Introduction

Stable embeddedness and N IP

Exact constructions with inexact diagrams

Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer)

Proof Theory and Subsystems of Second-Order Arithmetic

Arithmetical Hierarchy

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Takeuti s finitism and his proof of the consistency of arithmetic

The constructible universe

Arithmetical Hierarchy

Notes on induction proofs and recursive definitions

arxiv: v1 [math.lo] 7 Dec 2017

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Measurement Independence, Parameter Independence and Non-locality

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)

The Epistemology of Geometry

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

cse541 LOGIC FOR COMPUTER SCIENCE

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

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

The Exact Strength of the Class Forcing Theorem

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

On the Relationship Between AT R 0 and ÎD <ω

Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson

Peano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now

The Integers. Peter J. Kahn

The World According to Wolfram

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

Dr Prya Mathew SJCE Mysore

WHAT THIS BOOK IS ABOUT

Metainduction in Operational Set Theory

On the Evolution of the Concept of Time

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

Part II Logic and Set Theory

The Banach-Tarski paradox

Difficulties of the set of natural numbers

185.A09 Advanced Mathematical Logic

Lecture 15 The Second Incompleteness Theorem. Michael Beeson

CS 2800: Logic and Computation Fall 2010 (Lecture 13)

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Introduction to Metalogic

MAGIC Set theory. lecture 2

Lecture 2: Syntax. January 24, 2018

Ordinal Strength of Logic-Enriched Type Theories

Direct Proofs. the product of two consecutive integers plus the larger of the two integers

Reverse Mathematics. Benedict Eastaugh December 13, 2011

Fuzzy Does Not Lie! Can BAŞKENT. 20 January 2006 Akçay, Göttingen, Amsterdam Student No:

Transcription:

Kant and Finitism Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy Bill Tait 4 June 2016

The Problems Kant in The Critique of Pure Reason: How can there be synthetic a priori knowledge of geometric propositions All S are P? BT in Finitism : How can there be finitist knowledge of propositions like PA is consistent or x : N.φ(x) where φ(x) is quantifier-free number-theoretic formula, i.e. knowledge that does not presuppose infinite totalities. How can we understand as even meaningful the formula φ(x) which contains function symbols such as + and which, as normally understood, are infinite objects?

I will talk about a certain relationship of Kant s conception of geometric knowledge critical philosophy to finitism in mathematics, as analyzed in my paper Finitism (Journal of Philosophy, 1981) and which underlies its argument that finitist number theory is precisely Skolem s primitive recursive arithmetic, PRA.

Finitism here should not be understood in the historical sense, as the foundational stance of the Hilbert school in the 1920 s. There is an extensive literature from members of that school and, more recently, the 1062 page edition of Hilbert s lectures in logic and proof theory, edited by William Ewald and Wilfried Sieg, to refer to. But there remain questions about how to understand this literature and I won t talk about that now except to say that, in spite of his well-known claim to affinity with Kant, there seems to be little of Kant in what he actually claims to have derived from him.

Notice that I refer only to Kant s conception of geometric reasoning. A number of commentators on Kant in relatively recent times have taken the view that Kant was concerned with of the theory of whole numbers that by number, i.e. Zahl he meant whole number and that by arithmetic he meant theory of whole numbers. But this is a misreading. I find in his writings absolutely nothing explicitly about the whole or natural numbers and their theory. He states explicitly that by number he means the real numbers, founded on the ancient theory of proportion.

But mathematics does not merely construct magnitudes (quanta), as in geometry, but also mere magnitude (quantitatem), as in algebra (Buchstabenrechnung), where it entirely abstracts from the constitution of the object that is to be thought in accordance with such a concept of magnitude. In this case it choses a certain notation for all construction of magnitudes in general (numbers), as well as addition, subtraction, etc., extraction of roots.... (The Critique of Pure Reason)

But to construct a concept means to exhibit a priori the intuition corresponding to it. For the construction of the concept, therefore, a non-empirical intuition is required, which consequently, as intuition, is an individual object, but that must nevertheless, as the construction of the concept (of a general representation), express in the representation universal validity for all possible intuitions that belong under the same concept. (The Critique of Pure Reason, A713/B741)

No image of a triangle would ever be adequate to the concept of it. For it would not attain the generality of the concept, which makes this valid for all triangles, right or acute, etc., but would always be limited to one part of this sphere. What holds of the triangle of pure intuition holds a priori of all triangles because it holds for the pure intuition.

The additional and crucial ingredient of Kant s theory involves the idea of The construction of an object b of type T from an object a of type S, such that (a, b) falls under a certain concept R (Think of Euclid, Book 1, Postulates 1-3), and The corresponding construction in pure intuition: from the pure object X of type S, we construct a pure object f (X ) of type T such that (X, f (X )) is of type R. and it is this latter that confirms a priori that from empirical objects a of type S, b = f (a) of type T can be constructed such that (a, b) is of type R. For Kant, the step from the proposition that (a, b) is of type R to the proposition that a falls under the concept P is analytic. Thus, the construction in pure intuition of f (X ) from X such that (X, f (X )) is of type R establishes a priori the proposition All S are P.

ψ = x : S y : T φ(x, y) where φ(x, y) contains no quantifiers and the x and y may be sequences of variables of different types (sorts). (Read x : S as x of type or sort S.) So we can replace the axioms ψ by the corresponding ψ = x : S φ(x, f (x)) where the Skolem functions f express exactly the construction that Euclid postulated (or should have postulated). In Kant s terms we have (X, f (X )) : R.

Basically, Euclid s theorems in plain geometry are also of this Π 2 form: x : S y : T ψ(x, g(x)) or with Skolem function constants and again in Kant s terms x : S ψ(x, g(x)) (X, g(x )) : R where the function g is built up from the functions f given in the postulates. In this way, the synthetic part of geometry for Kant is all in the possibility of the constructions g such that (X, g(x )) : R. The rest is analytic in his sense: The predicate concept is contained in the subject concept.

If we turn to this ordinal conception of number, it is reasonable to take the concept N of a natural number to be simply that of a finite succession or iteration, so that a pure object of type N, i.e. a generic natural number, Y, is simply an arbitrary finite iteration, which we may represent by 0, 1, 2,..., Y iterating the successor operation x x starting with 0.

Now we can ask what constructions f (X ) follow specifically from the fact that we are dealing with a sequence X of generic finite iterations. Obviously, we can construct the null iteration, 0, and the successor Y of the generic number Y. In particular, then, each natural number can be constructed. This differs from the Kantian conception: the pure objects of geometric type S do not live in the same space as the empirical objects of type S.

Moreover, given the generic iteration Y and the construction X f (X ), where X and f (X ) are of some type S, we can apply the iteration Y represented by 0, 1, 2,..., Y to iterate the operation X g(x ) starting with X : X, g(x ), g(g(x )),..., g Y (X ) defining the unique construction f (X, Y ) = g Y (X ). Thus, f (X, Y ) of type S is uniquely defined by f (X, 0) = X f (X, Y ) = g(f (X, Y )).

It is along just these lines that the analysis of finitist number theory in question goes. Actually, to found proof by mathematical induction we need to introduce dependent types Γ(X ) = f (X ) = g(x ) where Γ(X ) is a conjunction of equations f i (X ) = g i (X ). A proof of f ( n) = g( n) where n is a sequence of natural numbers is any computation leading to an identity k = k and a proof of an implication is a construction of a proof of the consequent from one of the antecedent I will spare you the further details. I ll also spare you further discussion entirely.

THANK YOU!

and HAPPY BIRTHDAY, JULIETTE!

The constructions built up by the means indicated along with some elementary constructions that are valid independently of the basic types involved, lead precisely to the system of PRA, and the considerations I ve just rehearsed were the argument that finitist number theory, in the sense that I am considering, is just PRA. Thus the Kantian pedigree of that analysis of the concept of finitist number theory seems quite distinguished. Moreover, the central role of iteration in this analysis of finitism also may have its historical source in Kant s discussion of number as the schema of magnitude. It would have been nice to have been able to strengthen the pedigree by attributing to Kant a conception of number theory according to which construction by finite iteration is implicit in the concept of an object of type N. But, alas, as I have argued, he didn t explicitly consider number theory at all in his account of mathematical demonstration. But there is some reason to believe that he did draw attention to the fundamental role of finite iteration in

mathematics. Euler, L. [1984]. Elements of Algebra, 5 edn, Springer-Verlag. Translation by John Hewlett from Vollstandige Anleiotnung zur Algebra, 1844. Tait, W. [1981]. Finitism, Journal of Philosophy 78: 524 556.