



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Maximal consistency theorem
Typology: Study notes
1 / 7
This page cannot be seen from the preview
Don't miss anything!




Dr Jochen Koenigsmann
Oxford, MT 2010
B1 (Foundations) = B1a (Logic) + B1b (Set theory)
N.B.: Course does not teach you to think logically, but it explores what it means to think logically
for all mathematics
inference rules/ deduction rules
mathematical axioms
consistent, i.e. does not lead to contradictions
⋆ complete: every mathematical sentence can be proved or disproved using 2. and 3. ⋆ 1., 2. and 3. should be finitary/effective/computable/algorithmic so, e.g., in 3. you can’t take as axioms the system of all true sentences in mathematics ⋆ idea: any piece of information is of finte length
Step 1. is possible in the framework of ZF = Zermelo-Fraenkel set theory or ZFC = ZF + Axiom of Choice (this is an empirical fact) ; B1b Set Theory HT 2011
Step 2. is possible in the framework of 1st-order logic: G¨odel’s Completeness Theorem ; B1a Logic - this course
Step 3. is not possible (; C1.1a): G¨odel’s 1st Incompleteness Theorem: there is no effective axiomatization of arithmetic
Step 4. is not possible(; C1.1a): G¨odel’s 2nd Incompleteness Theorem