![Page 1: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/1.jpg)
Tutorial Series on Reverse Mathematics
Denis R. Hirschfeldt — University of Chicago
2017 NZMRI Summer School, Napier, New Zealand
![Page 2: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/2.jpg)
Tutorial Series on Reverse Mathematics
Denis R. Hirschfeldt — University of Chicago
2017 NZMRI Summer School, Napier, New Zealand
![Page 3: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/3.jpg)
Part I: Background
![Page 4: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/4.jpg)
A Bit of Historical Context
![Page 5: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/5.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics
19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 6: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/6.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 7: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/7.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 8: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/8.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 9: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/9.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 10: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/10.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox
: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 11: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/11.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 12: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/12.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 13: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/13.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 14: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/14.jpg)
A Bit of Historical Context: Abstraction and the Loss of Certainty
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Increase in power, but also a loss of intuition
Increased demand for rigor
Cantor’s Paradise
Russell’s Paradox: Let S = {A : A /∈ A}. Is S ∈ S?
Crisis in foundations
Hilbert’s Program: prove the consistency of mathematics viafinitistic methods
Godel’s Second Incompleteness Theorem
![Page 15: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/15.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 16: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/16.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 17: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/17.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 18: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/18.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 19: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/19.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 20: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/20.jpg)
A Bit of Historical Context: Reverse Mathematics
Nada se edifica sobre la piedra, todo sobre la arena,pero nuestro deber es edificar como si fuera piedra laarena.
— Jorge Luis Borges
We can still try to understand how much axiomatic power giventheorems need.
Fix a weak base axiomatic system B.
Given a theorem T , we can find an axiomatic system S ⊇ Bsufficient to prove T .
If we can then also show that the axioms of S are provable fromB + T , then we know S is exactly what we need to prove T .
We can also compare theorems in terms of implication over B.
![Page 21: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/21.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
![Page 22: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/22.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
![Page 23: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/23.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
![Page 24: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/24.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
![Page 25: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/25.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
![Page 26: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/26.jpg)
A Bit of Historical Context: Algorithms in Mathematics
The writing machine at theA Llullian circle Grand Academy of Lagado
(Gulliver’s Travels, 1726)
![Page 27: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/27.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
Emil du Bois-Reymond’s ignoramus et ignorabimus (1880) andHilbert’s “Wir mussen wissen—wir werden wissen.” (1930)
![Page 28: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/28.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
Emil du Bois-Reymond’s ignoramus et ignorabimus (1880) andHilbert’s “Wir mussen wissen—wir werden wissen.” (1930)
![Page 29: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/29.jpg)
A Bit of Historical Context: Algorithms in Mathematics
![Page 30: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/30.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
Emil du Bois-Reymond’s ignoramus et ignorabimus (1880) andHilbert’s “Wir mussen wissen—wir werden wissen.” (1930)
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
![Page 31: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/31.jpg)
A Bit of Historical Context: Algorithms in Mathematics
Concrete, algorithmic mathematics 19th c.−→ Abstract mathematics
Loss of algorithmic content
Increased interest in the notion of computability
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Ramon Llull (c. 1232–1315), Gottfried Leibniz (1646–1716)
Emil du Bois-Reymond’s ignoramus et ignorabimus (1880) andHilbert’s “Wir mussen wissen—wir werden wissen.” (1930)
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
![Page 32: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/32.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 33: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/33.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 34: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/34.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 35: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/35.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 36: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/36.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 37: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/37.jpg)
A Bit of Historical Context: Computability Theory
Despite Hilbertian optimism, not all problems have algorithms.
Examples require a formal notion of computability.
Various proposed definitions by Church, Godel, Herbrand,Kleene in the 1930’s
Turing’s machine-based definition (1936)
All of these definitions are equivalent.
Church-Turing Thesis: This definition captures the intuitive notionof “computable”.
![Page 38: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/38.jpg)
A Bit of Historical Context: Computability Theory
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Thm (Church; Turing). There is no such algorithm.
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
Thm (Davis; Putnam; Robinson; Matiyasevich). There is no suchalgorithm.
Many other objects have been shown to be noncomputable.
Computability theory has tools to compare such objects.
![Page 39: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/39.jpg)
A Bit of Historical Context: Computability Theory
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Thm (Church; Turing). There is no such algorithm.
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
Thm (Davis; Putnam; Robinson; Matiyasevich). There is no suchalgorithm.
Many other objects have been shown to be noncomputable.
Computability theory has tools to compare such objects.
![Page 40: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/40.jpg)
A Bit of Historical Context: Computability Theory
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Thm (Church; Turing). There is no such algorithm.
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
Thm (Davis; Putnam; Robinson; Matiyasevich). There is no suchalgorithm.
Many other objects have been shown to be noncomputable.
Computability theory has tools to compare such objects.
![Page 41: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/41.jpg)
A Bit of Historical Context: Computability Theory
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Thm (Church; Turing). There is no such algorithm.
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
Thm (Davis; Putnam; Robinson; Matiyasevich). There is no suchalgorithm.
Many other objects have been shown to be noncomputable.
Computability theory has tools to compare such objects.
![Page 42: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/42.jpg)
A Bit of Historical Context: Computability Theory
Hilbert’s Entscheidungsproblem: algorithm to decide, given a setof axioms A and a statement σ, whether σ follows from A
Thm (Church; Turing). There is no such algorithm.
Hilbert’s 10th Problem: algorithm to decide whether a givenDiophantine equation has a solution
Thm (Davis; Putnam; Robinson; Matiyasevich). There is no suchalgorithm.
Many other objects have been shown to be noncomputable.
Computability theory has tools to compare such objects.
![Page 43: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/43.jpg)
A Bit of Computability Theory
![Page 44: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/44.jpg)
A Bit of Computability Theory
We look at countably infinite objects built out of finite ones, e.g.sets of natural numbers, sets of finite strings, functions N→ N, etc.
Computability for such objects can bethought of via an informal idea of algorithm;defined formally using a model such as Turing machines.
We can list all Turing machines (with inputs and outputs in N), insuch a way that we can simulate the computation of the eth
machine on input n using a universal Turing machine.
A Turing machine may fail to halt on a given input, so this listyields a list Φ0,Φ1, . . . of all partial computable functions.
We write Φe(n)↓ to mean that Φe is defined on n.
![Page 45: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/45.jpg)
A Bit of Computability Theory
We look at countably infinite objects built out of finite ones, e.g.sets of natural numbers, sets of finite strings, functions N→ N, etc.
Computability for such objects can bethought of via an informal idea of algorithm;defined formally using a model such as Turing machines.
We can list all Turing machines (with inputs and outputs in N), insuch a way that we can simulate the computation of the eth
machine on input n using a universal Turing machine.
A Turing machine may fail to halt on a given input, so this listyields a list Φ0,Φ1, . . . of all partial computable functions.
We write Φe(n)↓ to mean that Φe is defined on n.
![Page 46: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/46.jpg)
A Bit of Computability Theory
We look at countably infinite objects built out of finite ones, e.g.sets of natural numbers, sets of finite strings, functions N→ N, etc.
Computability for such objects can bethought of via an informal idea of algorithm;defined formally using a model such as Turing machines.
We can list all Turing machines (with inputs and outputs in N), insuch a way that we can simulate the computation of the eth
machine on input n using a universal Turing machine.
A Turing machine may fail to halt on a given input, so this listyields a list Φ0,Φ1, . . . of all partial computable functions.
We write Φe(n)↓ to mean that Φe is defined on n.
![Page 47: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/47.jpg)
A Bit of Computability Theory
We look at countably infinite objects built out of finite ones, e.g.sets of natural numbers, sets of finite strings, functions N→ N, etc.
Computability for such objects can bethought of via an informal idea of algorithm;defined formally using a model such as Turing machines.
We can list all Turing machines (with inputs and outputs in N), insuch a way that we can simulate the computation of the eth
machine on input n using a universal Turing machine.
A Turing machine may fail to halt on a given input, so this listyields a list Φ0,Φ1, . . . of all partial computable functions.
We write Φe(n)↓ to mean that Φe is defined on n.
![Page 48: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/48.jpg)
A Bit of Computability Theory
We look at countably infinite objects built out of finite ones, e.g.sets of natural numbers, sets of finite strings, functions N→ N, etc.
Computability for such objects can bethought of via an informal idea of algorithm;defined formally using a model such as Turing machines.
We can list all Turing machines (with inputs and outputs in N), insuch a way that we can simulate the computation of the eth
machine on input n using a universal Turing machine.
A Turing machine may fail to halt on a given input, so this listyields a list Φ0,Φ1, . . . of all partial computable functions.
We write Φe(n)↓ to mean that Φe is defined on n.
![Page 49: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/49.jpg)
A Bit of Computability Theory
The Halting Problem is ∅′ = {〈e,n〉 : Φe(n)↓}.
Thm (Turing). ∅′ is not computable.
Pf. By diagonalization: Suppose that ∅′ is computable.
Then so is f (e) =
{Φe(e) + 1 if 〈e,e〉 ∈ ∅′
0 otherwise.
Thus Φe = f for some e.
Then Φe(e)↓ = f (e) = Φe(e) + 1. �
A similar proof shows that there is no effective list of all totalcomputable functions.
![Page 50: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/50.jpg)
A Bit of Computability Theory
The Halting Problem is ∅′ = {〈e,n〉 : Φe(n)↓}.
Thm (Turing). ∅′ is not computable.
Pf. By diagonalization: Suppose that ∅′ is computable.
Then so is f (e) =
{Φe(e) + 1 if 〈e,e〉 ∈ ∅′
0 otherwise.
Thus Φe = f for some e.
Then Φe(e)↓ = f (e) = Φe(e) + 1. �
A similar proof shows that there is no effective list of all totalcomputable functions.
![Page 51: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/51.jpg)
A Bit of Computability Theory
The Halting Problem is ∅′ = {〈e,n〉 : Φe(n)↓}.
Thm (Turing). ∅′ is not computable.
Pf. By diagonalization: Suppose that ∅′ is computable.
Then so is f (e) =
{Φe(e) + 1 if 〈e,e〉 ∈ ∅′
0 otherwise.
Thus Φe = f for some e.
Then Φe(e)↓ = f (e) = Φe(e) + 1. �
A similar proof shows that there is no effective list of all totalcomputable functions.
![Page 52: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/52.jpg)
A Bit of Computability Theory
The Halting Problem is ∅′ = {〈e,n〉 : Φe(n)↓}.
Thm (Turing). ∅′ is not computable.
Pf. By diagonalization: Suppose that ∅′ is computable.
Then so is f (e) =
{Φe(e) + 1 if 〈e,e〉 ∈ ∅′
0 otherwise.
Thus Φe = f for some e.
Then Φe(e)↓ = f (e) = Φe(e) + 1. �
A similar proof shows that there is no effective list of all totalcomputable functions.
![Page 53: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/53.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 54: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/54.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 55: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/55.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 56: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/56.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 57: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/57.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 58: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/58.jpg)
A Bit of Computability Theory
∅′ is not computable, but it is computably enumerable (c.e.).
So are the sets in the Entscheidungsproblem and in Hilbert’s 10th
problem.
A is computable relative to B if there is an algorithm forcomputing A if given access to B.
Can be formalized using Turing machines with oracle tapes.
We write A 6T B and say that A is Turing reducible to B.
If A 6T B and B 6T A then A and B are Turing equivalent.
The resulting equivalence classes are the Turing degrees.
The degree of the join A⊕ B = {2n : n ∈ A} ∪ {2n + 1 : n ∈ B} is theleast upper bound of the degrees of A and B.
![Page 59: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/59.jpg)
A Bit of Computability Theory
For a c.e. A, define a partial computable f s.t. f (n)↓ iff n ∈ A.
∅′ can tell whether f (n)↓, so A is computable relative to ∅′.
We say that ∅′ is a complete c.e. set.
The undecidability of the Entscheidungsproblem and of Hilbert’s10th problem are proved by encoding ∅′.
So the corresponding c.e. sets are also complete, i.e., they are inthe same Turing degree as ∅′.
Thm (Friedberg; Muchnik). There are noncomputable,incomplete c.e. sets.
There are also non-c.e. sets that are computable relative to ∅′,including co-c.e. sets but also many others.
![Page 60: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/60.jpg)
A Bit of Computability Theory
For a c.e. A, define a partial computable f s.t. f (n)↓ iff n ∈ A.
∅′ can tell whether f (n)↓, so A is computable relative to ∅′.
We say that ∅′ is a complete c.e. set.
The undecidability of the Entscheidungsproblem and of Hilbert’s10th problem are proved by encoding ∅′.
So the corresponding c.e. sets are also complete, i.e., they are inthe same Turing degree as ∅′.
Thm (Friedberg; Muchnik). There are noncomputable,incomplete c.e. sets.
There are also non-c.e. sets that are computable relative to ∅′,including co-c.e. sets but also many others.
![Page 61: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/61.jpg)
A Bit of Computability Theory
For a c.e. A, define a partial computable f s.t. f (n)↓ iff n ∈ A.
∅′ can tell whether f (n)↓, so A is computable relative to ∅′.
We say that ∅′ is a complete c.e. set.
The undecidability of the Entscheidungsproblem and of Hilbert’s10th problem are proved by encoding ∅′.
So the corresponding c.e. sets are also complete, i.e., they are inthe same Turing degree as ∅′.
Thm (Friedberg; Muchnik). There are noncomputable,incomplete c.e. sets.
There are also non-c.e. sets that are computable relative to ∅′,including co-c.e. sets but also many others.
![Page 62: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/62.jpg)
A Bit of Computability Theory
For a c.e. A, define a partial computable f s.t. f (n)↓ iff n ∈ A.
∅′ can tell whether f (n)↓, so A is computable relative to ∅′.
We say that ∅′ is a complete c.e. set.
The undecidability of the Entscheidungsproblem and of Hilbert’s10th problem are proved by encoding ∅′.
So the corresponding c.e. sets are also complete, i.e., they are inthe same Turing degree as ∅′.
Thm (Friedberg; Muchnik). There are noncomputable,incomplete c.e. sets.
There are also non-c.e. sets that are computable relative to ∅′,including co-c.e. sets but also many others.
![Page 63: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/63.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 64: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/64.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 65: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/65.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 66: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/66.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 67: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/67.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 68: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/68.jpg)
A Bit of Computability Theory
We can relativize other computability-theoretic concepts.
We can define the concept of being c.e. relative to X .
Let ΦX0 ,Φ
X1 , . . . be the functions that are partial computable
relative to X .
We can define the Halting Problem relative to X asX ′ = {〈e,n〉 : ΦX
e(n)↓}.
We call this the (Turing) jump of X .
If X 6T Y then X ′ 6T Y ′, but not necessarily vice-versa.
Computability-theoretic results tend to relativize.
E.g., X ′ is not computable relative to X , and is complete for setsc.e. relative to X .
![Page 69: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/69.jpg)
Part II: Computability-Theoretic Comparison
![Page 70: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/70.jpg)
An Example: Versions of Konig’s Lemma
![Page 71: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/71.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 72: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/72.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 73: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/73.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 74: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/74.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 75: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/75.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 76: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/76.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 77: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/77.jpg)
Trees and Paths
A tree is a subset T of N<ω closed under initial segments.
T is computable if there is an algorithm for determining whethera given σ is in T .
T is finitely branching if for each σ ∈ T , |{n : σn ∈ T}| <∞.
T is binary if it is a subset of 2<ω.
A path on T is a P ∈ Nω s.t. every initial segment of P is in T .
Put a topology on Nω by taking {X : σ ≺ X} as basic open sets.
Then C is closed iff it is the set of paths on a tree.
Put a measure on 2ω by letting µ({X : σ ≺ X}) = 2−|σ|.
![Page 78: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/78.jpg)
Versions of Konig’s Lemma
Konig’s Lemma: Every infinite, finitely branching tree has a path.
Weak Konig’s Lemma: Every infinite binary tree has a path.
Weak Weak Konig’s Lemma: Every binary tree T s.t.
lim infn|{σ∈T :|σ|=n}|
2n > 0
has a path.
Bounded Konig’s Lemma: Every infinite binary tree T s.t.
|{σ ∈ T : |σ| = n}| < c
for some c has a path.
![Page 79: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/79.jpg)
Versions of Konig’s Lemma
Konig’s Lemma: Every infinite, finitely branching tree has a path.
Weak Konig’s Lemma: Every infinite binary tree has a path.
Weak Weak Konig’s Lemma: Every binary tree T s.t.
lim infn|{σ∈T :|σ|=n}|
2n > 0
has a path.
Bounded Konig’s Lemma: Every infinite binary tree T s.t.
|{σ ∈ T : |σ| = n}| < c
for some c has a path.
![Page 80: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/80.jpg)
Versions of Konig’s Lemma
Konig’s Lemma: Every infinite, finitely branching tree has a path.
Weak Konig’s Lemma: Every infinite binary tree has a path.
Weak Weak Konig’s Lemma: Every binary tree T s.t.
lim infn|{σ∈T :|σ|=n}|
2n > 0
has a path.
Bounded Konig’s Lemma: Every infinite binary tree T s.t.
|{σ ∈ T : |σ| = n}| < c
for some c has a path.
![Page 81: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/81.jpg)
Versions of Konig’s Lemma
Konig’s Lemma: Every infinite, finitely branching tree has a path.
Weak Konig’s Lemma: Every infinite binary tree has a path.
Weak Weak Konig’s Lemma: Every binary tree T s.t.
lim infn|{σ∈T :|σ|=n}|
2n > 0
has a path.
Bounded Konig’s Lemma: Every infinite binary tree T s.t.
|{σ ∈ T : |σ| = n}| < c
for some c has a path.
![Page 82: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/82.jpg)
Versions of Konig’s Lemma
KL: Infinite, finitely branching trees have paths.
WKL: Infinite binary trees have paths.
WWKL: Fat binary trees have paths.
BKL: Skinny infinite binary trees have paths.
WKL says that 2ω is compact.
KL says that certain subspaces of Nω are compact, but thesesubspaces are not as effectively presented.
WKL: Find an element of a closed set.
WWKL: Find an element of a closed of positive measure.
BKL: Find an element of a finite set.
![Page 83: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/83.jpg)
Versions of Konig’s Lemma
KL: Infinite, finitely branching trees have paths.
WKL: Infinite binary trees have paths.
WWKL: Fat binary trees have paths.
BKL: Skinny infinite binary trees have paths.
WKL says that 2ω is compact.
KL says that certain subspaces of Nω are compact, but thesesubspaces are not as effectively presented.
WKL: Find an element of a closed set.
WWKL: Find an element of a closed of positive measure.
BKL: Find an element of a finite set.
![Page 84: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/84.jpg)
Versions of Konig’s Lemma
KL: Infinite, finitely branching trees have paths.
WKL: Infinite binary trees have paths.
WWKL: Fat binary trees have paths.
BKL: Skinny infinite binary trees have paths.
WKL says that 2ω is compact.
KL says that certain subspaces of Nω are compact, but thesesubspaces are not as effectively presented.
WKL: Find an element of a closed set.
WWKL: Find an element of a closed of positive measure.
BKL: Find an element of a finite set.
![Page 85: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/85.jpg)
Versions of Konig’s Lemma
KL: Infinite, finitely branching trees have paths.
WKL: Infinite binary trees have paths.
WWKL: Fat binary trees have paths.
BKL: Skinny infinite binary trees have paths.
WKL says that 2ω is compact.
KL says that certain subspaces of Nω are compact, but thesesubspaces are not as effectively presented.
WKL: Find an element of a closed set.
WWKL: Find an element of a closed of positive measure.
BKL: Find an element of a finite set.
![Page 86: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/86.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 87: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/87.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 88: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/88.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 89: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/89.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 90: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/90.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 91: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/91.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 92: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/92.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 93: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/93.jpg)
Bounded Konig’s Lemma and Computability
Let T be a computable infinite binary tree s.t.|{σ ∈ T : |σ| = n}| < c for all n.
There is a σ ∈ T extended by a unique path P on T .
For each n > |σ|, there is a unique τn � σ of length n s.t. T isinfinite above τn.
We can find τn computably.
P = limn τn, so T has a computable path.
In fact, every path on T is computable.
More generally, even if T is not computable, the aboveprocedure is computable relative to T .
Thus BKL is computably true.
![Page 94: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/94.jpg)
Konig’s Lemma and Computability
Thm (Kreisel). There is a computable infinite binary tree with nocomputable path.
Thus WKL is not computably true, and hence neither is KL.
Kreisel’s tree can be fat, so WWKL is also not computably true.
To build such a tree, we diagonalize against all potentialcomputable paths.
There is a computable infinite, finitely branching tree T s.t. everypath of T computes ∅′.
There is a computable infinite, finitely branching tree T with nopath computable relative to ∅′.
![Page 95: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/95.jpg)
Konig’s Lemma and Computability
Thm (Kreisel). There is a computable infinite binary tree with nocomputable path.
Thus WKL is not computably true, and hence neither is KL.
Kreisel’s tree can be fat, so WWKL is also not computably true.
To build such a tree, we diagonalize against all potentialcomputable paths.
There is a computable infinite, finitely branching tree T s.t. everypath of T computes ∅′.
There is a computable infinite, finitely branching tree T with nopath computable relative to ∅′.
![Page 96: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/96.jpg)
Konig’s Lemma and Computability
Thm (Kreisel). There is a computable infinite binary tree with nocomputable path.
Thus WKL is not computably true, and hence neither is KL.
Kreisel’s tree can be fat, so WWKL is also not computably true.
To build such a tree, we diagonalize against all potentialcomputable paths.
There is a computable infinite, finitely branching tree T s.t. everypath of T computes ∅′.
There is a computable infinite, finitely branching tree T with nopath computable relative to ∅′.
![Page 97: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/97.jpg)
Konig’s Lemma and Computability
Thm (Kreisel). There is a computable infinite binary tree with nocomputable path.
Thus WKL is not computably true, and hence neither is KL.
Kreisel’s tree can be fat, so WWKL is also not computably true.
To build such a tree, we diagonalize against all potentialcomputable paths.
There is a computable infinite, finitely branching tree T s.t. everypath of T computes ∅′.
There is a computable infinite, finitely branching tree T with nopath computable relative to ∅′.
![Page 98: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/98.jpg)
Weak Konig’s Lemma and Computability
Let T be a computable infinite binary tree.
Thm (Kreisel). T has a path P 6T ∅′.
An example is the leftmost path of T .
Thm (Shoenfield). T has a path P <T ∅′.
Thus WKL is strictly weaker than KL in at least two senses.
But just how much weaker?
Low Basis Thm (Jockusch and Soare). T has a path P s.t. P ′ 6T ∅′.
Such a P is called low.
This theorem relativizes: If the binary tree T is computablerelative to X then T has a path P s.t. (P ⊕ X)′ 6T X ′.
![Page 99: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/99.jpg)
Weak Konig’s Lemma and Computability
Let T be a computable infinite binary tree.
Thm (Kreisel). T has a path P 6T ∅′.
An example is the leftmost path of T .
Thm (Shoenfield). T has a path P <T ∅′.
Thus WKL is strictly weaker than KL in at least two senses.
But just how much weaker?
Low Basis Thm (Jockusch and Soare). T has a path P s.t. P ′ 6T ∅′.
Such a P is called low.
This theorem relativizes: If the binary tree T is computablerelative to X then T has a path P s.t. (P ⊕ X)′ 6T X ′.
![Page 100: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/100.jpg)
Weak Konig’s Lemma and Computability
Let T be a computable infinite binary tree.
Thm (Kreisel). T has a path P 6T ∅′.
An example is the leftmost path of T .
Thm (Shoenfield). T has a path P <T ∅′.
Thus WKL is strictly weaker than KL in at least two senses.
But just how much weaker?
Low Basis Thm (Jockusch and Soare). T has a path P s.t. P ′ 6T ∅′.
Such a P is called low.
This theorem relativizes: If the binary tree T is computablerelative to X then T has a path P s.t. (P ⊕ X)′ 6T X ′.
![Page 101: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/101.jpg)
Weak Konig’s Lemma and Computability
Let T be a computable infinite binary tree.
Thm (Kreisel). T has a path P 6T ∅′.
An example is the leftmost path of T .
Thm (Shoenfield). T has a path P <T ∅′.
Thus WKL is strictly weaker than KL in at least two senses.
But just how much weaker?
Low Basis Thm (Jockusch and Soare). T has a path P s.t. P ′ 6T ∅′.
Such a P is called low.
This theorem relativizes: If the binary tree T is computablerelative to X then T has a path P s.t. (P ⊕ X)′ 6T X ′.
![Page 102: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/102.jpg)
Weak Konig’s Lemma and Computability
Let T be a computable infinite binary tree.
Thm (Kreisel). T has a path P 6T ∅′.
An example is the leftmost path of T .
Thm (Shoenfield). T has a path P <T ∅′.
Thus WKL is strictly weaker than KL in at least two senses.
But just how much weaker?
Low Basis Thm (Jockusch and Soare). T has a path P s.t. P ′ 6T ∅′.
Such a P is called low.
This theorem relativizes: If the binary tree T is computablerelative to X then T has a path P s.t. (P ⊕ X)′ 6T X ′.
![Page 103: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/103.jpg)
Computable Entailment
![Page 104: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/104.jpg)
Second-Order Statements
Versions of KL are second-order statements, involvingquantification over first-order (finite) objects and second-order(countably infinite) objects.
We can encode finite objects as natural numbers: e.g., strings,rationals, finite sets, . . .
We can encode countably infinite objects as sets of naturalnumbers: e.g., infinite sequences, trees, groups, reals, . . .
So we might encode a σ ∈ 2<ω of length n as2σ(0) + 4σ(1) + · · ·+ 2nσ(n− 1).
Then a tree is just a particular kind of subset of N.
Thus we can work in second-order arithmetic.
![Page 105: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/105.jpg)
Second-Order Statements
Versions of KL are second-order statements, involvingquantification over first-order (finite) objects and second-order(countably infinite) objects.
We can encode finite objects as natural numbers: e.g., strings,rationals, finite sets, . . .
We can encode countably infinite objects as sets of naturalnumbers: e.g., infinite sequences, trees, groups, reals, . . .
So we might encode a σ ∈ 2<ω of length n as2σ(0) + 4σ(1) + · · ·+ 2nσ(n− 1).
Then a tree is just a particular kind of subset of N.
Thus we can work in second-order arithmetic.
![Page 106: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/106.jpg)
Second-Order Statements
Versions of KL are second-order statements, involvingquantification over first-order (finite) objects and second-order(countably infinite) objects.
We can encode finite objects as natural numbers: e.g., strings,rationals, finite sets, . . .
We can encode countably infinite objects as sets of naturalnumbers: e.g., infinite sequences, trees, groups, reals, . . .
So we might encode a σ ∈ 2<ω of length n as2σ(0) + 4σ(1) + · · ·+ 2nσ(n− 1).
Then a tree is just a particular kind of subset of N.
Thus we can work in second-order arithmetic.
![Page 107: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/107.jpg)
Π12 Statements
Statements involving only first-order quantification are calledarithmetic.
Version of KL are of the form
∀X [Θ(X) → ∃Y Ψ(X ,Y )],
where Θ and Ψ are arithmetic.
We can think of such a statement as a problem:An instance is an X s.t. Θ(X) holds.A solution to X is a Y s.t. Ψ(X ,Y ) holds.
Solving an instance of WKL takes less power than solving aninstance of KL.
But what about multiple instances?
![Page 108: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/108.jpg)
Π12 Statements
Statements involving only first-order quantification are calledarithmetic.
Version of KL are of the form
∀X [Θ(X) → ∃Y Ψ(X ,Y )],
where Θ and Ψ are arithmetic.
We can think of such a statement as a problem:An instance is an X s.t. Θ(X) holds.A solution to X is a Y s.t. Ψ(X ,Y ) holds.
Solving an instance of WKL takes less power than solving aninstance of KL.
But what about multiple instances?
![Page 109: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/109.jpg)
Π12 Statements
Statements involving only first-order quantification are calledarithmetic.
Version of KL are of the form
∀X [Θ(X) → ∃Y Ψ(X ,Y )],
where Θ and Ψ are arithmetic.
We can think of such a statement as a problem:An instance is an X s.t. Θ(X) holds.A solution to X is a Y s.t. Ψ(X ,Y ) holds.
Solving an instance of WKL takes less power than solving aninstance of KL.
But what about multiple instances?
![Page 110: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/110.jpg)
Π12 Statements
Statements involving only first-order quantification are calledarithmetic.
Version of KL are of the form
∀X [Θ(X) → ∃Y Ψ(X ,Y )],
where Θ and Ψ are arithmetic.
We can think of such a statement as a problem:An instance is an X s.t. Θ(X) holds.A solution to X is a Y s.t. Ψ(X ,Y ) holds.
Solving an instance of WKL takes less power than solving aninstance of KL.
But what about multiple instances?
![Page 111: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/111.jpg)
Π12 Statements
Statements involving only first-order quantification are calledarithmetic.
Version of KL are of the form
∀X [Θ(X) → ∃Y Ψ(X ,Y )],
where Θ and Ψ are arithmetic.
We can think of such a statement as a problem:An instance is an X s.t. Θ(X) holds.A solution to X is a Y s.t. Ψ(X ,Y ) holds.
Solving an instance of WKL takes less power than solving aninstance of KL.
But what about multiple instances?
![Page 112: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/112.jpg)
Turing Ideals
A Turing ideal is an I ⊆ 2N s.t. if B1, . . . ,Bn ∈ I and A iscomputable relative to B1, . . . ,Bn then A ∈ I.
A problem P holds in I if for every instance X of P in I, there is asolution Y to X in I.
P computably entails Q, written as P �c Q, if Q holds in everyTuring ideal in which P holds.
P and Q are computably equivalent if they hold in the sameTuring ideals.
A statement Φ of second-order arithmetic holds in I if Φ is truewhen ∃X and ∀X are replaced by ∃X ∈ I and ∀X ∈ I.
![Page 113: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/113.jpg)
Turing Ideals
A Turing ideal is an I ⊆ 2N s.t. if B1, . . . ,Bn ∈ I and A iscomputable relative to B1, . . . ,Bn then A ∈ I.
A problem P holds in I if for every instance X of P in I, there is asolution Y to X in I.
P computably entails Q, written as P �c Q, if Q holds in everyTuring ideal in which P holds.
P and Q are computably equivalent if they hold in the sameTuring ideals.
A statement Φ of second-order arithmetic holds in I if Φ is truewhen ∃X and ∀X are replaced by ∃X ∈ I and ∀X ∈ I.
![Page 114: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/114.jpg)
Turing Ideals
A Turing ideal is an I ⊆ 2N s.t. if B1, . . . ,Bn ∈ I and A iscomputable relative to B1, . . . ,Bn then A ∈ I.
A problem P holds in I if for every instance X of P in I, there is asolution Y to X in I.
P computably entails Q, written as P �c Q, if Q holds in everyTuring ideal in which P holds.
P and Q are computably equivalent if they hold in the sameTuring ideals.
A statement Φ of second-order arithmetic holds in I if Φ is truewhen ∃X and ∀X are replaced by ∃X ∈ I and ∀X ∈ I.
![Page 115: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/115.jpg)
Turing Ideals
A Turing ideal is an I ⊆ 2N s.t. if B1, . . . ,Bn ∈ I and A iscomputable relative to B1, . . . ,Bn then A ∈ I.
A problem P holds in I if for every instance X of P in I, there is asolution Y to X in I.
P computably entails Q, written as P �c Q, if Q holds in everyTuring ideal in which P holds.
P and Q are computably equivalent if they hold in the sameTuring ideals.
A statement Φ of second-order arithmetic holds in I if Φ is truewhen ∃X and ∀X are replaced by ∃X ∈ I and ∀X ∈ I.
![Page 116: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/116.jpg)
Building Turing Ideals
Clearly KL �c WKL and WKL �c WWKL.
BKL holds in every Turing ideal, so WWKL �c BKL.
The computable sets form a Turing ideal I, and WWKL does nothold in I, so BKL 2c WWKL.
Thm (Scott/Jockusch and Soare/Friedman). WKL 2c KL.
The proof uses the relativized Low Basis Theorem: If the binarytree T is computable relative to X then T has a path P s.t.(P ⊕ X)′ 6T X ′.
Thm (Yu and Simpson). WWKL 2c WKL.
The proof uses the theory of algorithmic randomness.
![Page 117: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/117.jpg)
Building Turing Ideals
Clearly KL �c WKL and WKL �c WWKL.
BKL holds in every Turing ideal, so WWKL �c BKL.
The computable sets form a Turing ideal I, and WWKL does nothold in I, so BKL 2c WWKL.
Thm (Scott/Jockusch and Soare/Friedman). WKL 2c KL.
The proof uses the relativized Low Basis Theorem: If the binarytree T is computable relative to X then T has a path P s.t.(P ⊕ X)′ 6T X ′.
Thm (Yu and Simpson). WWKL 2c WKL.
The proof uses the theory of algorithmic randomness.
![Page 118: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/118.jpg)
Building Turing Ideals
Clearly KL �c WKL and WKL �c WWKL.
BKL holds in every Turing ideal, so WWKL �c BKL.
The computable sets form a Turing ideal I, and WWKL does nothold in I, so BKL 2c WWKL.
Thm (Scott/Jockusch and Soare/Friedman). WKL 2c KL.
The proof uses the relativized Low Basis Theorem: If the binarytree T is computable relative to X then T has a path P s.t.(P ⊕ X)′ 6T X ′.
Thm (Yu and Simpson). WWKL 2c WKL.
The proof uses the theory of algorithmic randomness.
![Page 119: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/119.jpg)
Building Turing Ideals
Clearly KL �c WKL and WKL �c WWKL.
BKL holds in every Turing ideal, so WWKL �c BKL.
The computable sets form a Turing ideal I, and WWKL does nothold in I, so BKL 2c WWKL.
Thm (Scott/Jockusch and Soare/Friedman). WKL 2c KL.
The proof uses the relativized Low Basis Theorem: If the binarytree T is computable relative to X then T has a path P s.t.(P ⊕ X)′ 6T X ′.
Thm (Yu and Simpson). WWKL 2c WKL.
The proof uses the theory of algorithmic randomness.
![Page 120: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/120.jpg)
Computable equivalence
BKL, WWKL, WKL, and KL represent important complexity levels.
Computably equivalent to BKL (i.e., computably true):I the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
Computably equivalent to WWKL:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 121: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/121.jpg)
Computable equivalence
BKL, WWKL, WKL, and KL represent important complexity levels.
Computably equivalent to BKL (i.e., computably true):I the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
Computably equivalent to WWKL:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 122: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/122.jpg)
Computable equivalence
BKL, WWKL, WKL, and KL represent important complexity levels.
Computably equivalent to BKL (i.e., computably true):I the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
Computably equivalent to WWKL:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 123: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/123.jpg)
Computable equivalence
Computably equivalent to WKL:I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
Computably equivalent to KL:I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 124: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/124.jpg)
Computable equivalence
Computably equivalent to WKL:I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
Computably equivalent to KL:I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 125: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/125.jpg)
Part III: Reverse Mathematics
![Page 126: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/126.jpg)
Stephen G. Simpson, Subsystems of Second Order Arithmetic
![Page 127: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/127.jpg)
Second-Order Arithmetic and RCA0
![Page 128: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/128.jpg)
Second-Order Arithmetic
We work in a language with number variables, set variables, andsymbols 0, 1, S, <,+, ·,∈.
Again we encode finite objects as natural numbers and infiniteobjects as sets of natural numbers.
Reverse Mathematics: fix a weak base system and calibrate thestrength of principles by considering implications over this system.
Often in terms of a few subsystems of second-order arithmetic.
![Page 129: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/129.jpg)
Second-Order Arithmetic
We work in a language with number variables, set variables, andsymbols 0, 1, S, <,+, ·,∈.
Again we encode finite objects as natural numbers and infiniteobjects as sets of natural numbers.
Reverse Mathematics: fix a weak base system and calibrate thestrength of principles by considering implications over this system.
Often in terms of a few subsystems of second-order arithmetic.
![Page 130: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/130.jpg)
Second-Order Arithmetic
We work in a language with number variables, set variables, andsymbols 0, 1, S, <,+, ·,∈.
Again we encode finite objects as natural numbers and infiniteobjects as sets of natural numbers.
Reverse Mathematics: fix a weak base system and calibrate thestrength of principles by considering implications over this system.
Often in terms of a few subsystems of second-order arithmetic.
![Page 131: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/131.jpg)
Second-Order Arithmetic
Full second-order arithmetic consists of
I axioms for a discrete ordered commutative semiring
I comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all formulas ϕ s.t. X is not free in ϕ
I induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)] → ∀n ϕ(n)
for all formulas ϕ
We obtain subsystems by limiting comprehension and induction.
![Page 132: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/132.jpg)
Second-Order Arithmetic
Full second-order arithmetic consists of
I axioms for a discrete ordered commutative semiring
I comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all formulas ϕ s.t. X is not free in ϕ
I induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)] → ∀n ϕ(n)
for all formulas ϕ
We obtain subsystems by limiting comprehension and induction.
![Page 133: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/133.jpg)
A Hierarchy of Arithmetic Formulas
A bounded quantifier is one of the form ∀x < t or ∃x < t .
A bounded-quantifier formula is an arithmetic formula in whichall quantifiers are bounded.
A Σ0n formula is one of the form
∃x1 ∀x2 ∃x3 ∀x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∃ if n is oddand ∀ if n is even.
A Π0n formula is one of the form
∀x1 ∃x2 ∀x3 ∃x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∀ if n is oddand ∃ if n is even.
These formulas can have free variables.
![Page 134: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/134.jpg)
A Hierarchy of Arithmetic Formulas
A bounded quantifier is one of the form ∀x < t or ∃x < t .
A bounded-quantifier formula is an arithmetic formula in whichall quantifiers are bounded.
A Σ0n formula is one of the form
∃x1 ∀x2 ∃x3 ∀x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∃ if n is oddand ∀ if n is even.
A Π0n formula is one of the form
∀x1 ∃x2 ∀x3 ∃x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∀ if n is oddand ∃ if n is even.
These formulas can have free variables.
![Page 135: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/135.jpg)
A Hierarchy of Arithmetic Formulas
A bounded quantifier is one of the form ∀x < t or ∃x < t .
A bounded-quantifier formula is an arithmetic formula in whichall quantifiers are bounded.
A Σ0n formula is one of the form
∃x1 ∀x2 ∃x3 ∀x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∃ if n is oddand ∀ if n is even.
A Π0n formula is one of the form
∀x1 ∃x2 ∀x3 ∃x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∀ if n is oddand ∃ if n is even.
These formulas can have free variables.
![Page 136: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/136.jpg)
A Hierarchy of Arithmetic Formulas
A bounded quantifier is one of the form ∀x < t or ∃x < t .
A bounded-quantifier formula is an arithmetic formula in whichall quantifiers are bounded.
A Σ0n formula is one of the form
∃x1 ∀x2 ∃x3 ∀x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∃ if n is oddand ∀ if n is even.
A Π0n formula is one of the form
∀x1 ∃x2 ∀x3 ∃x4 · · ·Qxn ϕ,
where ϕ is a bounded-quantifier formula and Q is ∀ if n is oddand ∃ if n is even.
These formulas can have free variables.
![Page 137: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/137.jpg)
The Weak Base System RCA0
RCA0 is obtained by restricting:
I comprehension to ∆01-comprehension:
∀n [ϕ(n) ↔ ψ(n)] → ∃X ∀n [n ∈ X ↔ ϕ(n)]
for all ϕ,ψ s.t. ϕ is Σ01 and ψ is Π0
1, and X is not free in ϕ
I induction to Σ01-induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)]) → ∀n ϕ(n)
for all Σ01 formulas ϕ
This choice of base system creates a tight connection betweenthis approach and computable entailment.
![Page 138: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/138.jpg)
The Weak Base System RCA0
RCA0 is obtained by restricting:
I comprehension to ∆01-comprehension:
∀n [ϕ(n) ↔ ψ(n)] → ∃X ∀n [n ∈ X ↔ ϕ(n)]
for all ϕ,ψ s.t. ϕ is Σ01 and ψ is Π0
1, and X is not free in ϕ
I induction to Σ01-induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)]) → ∀n ϕ(n)
for all Σ01 formulas ϕ
This choice of base system creates a tight connection betweenthis approach and computable entailment.
![Page 139: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/139.jpg)
Some Equivalences over RCA0
Provable in RCA0
I the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
Provably equivalent to WWKL over RCA0:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 140: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/140.jpg)
Some Equivalences over RCA0
Provable in RCA0
I the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
Provably equivalent to WWKL over RCA0:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 141: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/141.jpg)
Some Equivalences over RCA0
Provably equivalent to WKL over RCA0:I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
Provably equivalent to KL over RCA0:I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 142: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/142.jpg)
Computability and Definability
![Page 143: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/143.jpg)
The Arithmetic Hierarchy
A first-order formula is one with no set variables.
A ⊆ N is defined in N by a first-order formula ϕ(y) if: k ∈ A iff ϕ(k)holds in N.
A set is Σ0n if it is defined in N by some Σ0
n first-order formula.
A set is Π0n if it is defined in N by some Π0
n first-order formula.
A set is ∆0n if it is both Σ0
n and Π0n.
A set is arithmetic if it is in one of these classes.
![Page 144: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/144.jpg)
The Arithmetic Hierarchy
A first-order formula is one with no set variables.
A ⊆ N is defined in N by a first-order formula ϕ(y) if: k ∈ A iff ϕ(k)holds in N.
A set is Σ0n if it is defined in N by some Σ0
n first-order formula.
A set is Π0n if it is defined in N by some Π0
n first-order formula.
A set is ∆0n if it is both Σ0
n and Π0n.
A set is arithmetic if it is in one of these classes.
![Page 145: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/145.jpg)
The Arithmetic Hierarchy
∆01 ∆0
2 ∆03 . . .
Σ01 Σ0
2
Π01 Π0
2
( (( ( (( (
( ( (
Thm (Kleene). A is Σ01 iff A is c.e. Thus A is ∆0
1 iff A is computable.
Recall that Z ′ is the Halting Problem relative to Z .
Define X (n) as follows: X (0) = X and X (n+1) = (X (n))′.
Thm (Post). A set is Σ0n+1 iff it is c.e. relative to ∅(n), and is ∆0
n+1 iff itis computable relative to ∅(n).
![Page 146: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/146.jpg)
The Arithmetic Hierarchy
∆01 ∆0
2 ∆03 . . .
Σ01 Σ0
2
Π01 Π0
2
( (( ( (( (
( ( (
Thm (Kleene). A is Σ01 iff A is c.e. Thus A is ∆0
1 iff A is computable.
Recall that Z ′ is the Halting Problem relative to Z .
Define X (n) as follows: X (0) = X and X (n+1) = (X (n))′.
Thm (Post). A set is Σ0n+1 iff it is c.e. relative to ∅(n), and is ∆0
n+1 iff itis computable relative to ∅(n).
![Page 147: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/147.jpg)
The Arithmetic Hierarchy
∆01 ∆0
2 ∆03 . . .
Σ01 Σ0
2
Π01 Π0
2
( (( ( (( (
( ( (
Thm (Kleene). A is Σ01 iff A is c.e. Thus A is ∆0
1 iff A is computable.
Recall that Z ′ is the Halting Problem relative to Z .
Define X (n) as follows: X (0) = X and X (n+1) = (X (n))′.
Thm (Post). A set is Σ0n+1 iff it is c.e. relative to ∅(n), and is ∆0
n+1 iff itis computable relative to ∅(n).
![Page 148: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/148.jpg)
The Arithmetic Hierarchy
∆01 ∆0
2 ∆03 . . .
Σ01 Σ0
2
Π01 Π0
2
( (( ( (( (
( ( (
Thm (Kleene). A is Σ01 iff A is c.e. Thus A is ∆0
1 iff A is computable.
Recall that Z ′ is the Halting Problem relative to Z .
Define X (n) as follows: X (0) = X and X (n+1) = (X (n))′.
Thm (Post). A set is Σ0n+1 iff it is c.e. relative to ∅(n), and is ∆0
n+1 iff itis computable relative to ∅(n).
![Page 149: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/149.jpg)
Relativizing the Arithmetic Hierarchy
All of this can be relativized to any S ⊆ N:
Consider arithmetic formulas with one free set variable X .
A ⊆ N is defined in (N, S) by ϕ(y ,X) if: k ∈ A iff ϕ(k , S) holds in N.
A set is Σ0n relative to S if it is defined in (N, S) by some Σ0
n formula.
A set is Π0n relative to S if it is defined in (N, S) by some Π0
n formula.
A set is ∆0n relative to S if it is both Σ0
n and Π0n relative to S.
Post’s Theorem holds in relativized form.
In particular, A is ∆01 relative to S iff A is computable relative to S.
![Page 150: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/150.jpg)
Relativizing the Arithmetic Hierarchy
All of this can be relativized to any S ⊆ N:
Consider arithmetic formulas with one free set variable X .
A ⊆ N is defined in (N, S) by ϕ(y ,X) if: k ∈ A iff ϕ(k , S) holds in N.
A set is Σ0n relative to S if it is defined in (N, S) by some Σ0
n formula.
A set is Π0n relative to S if it is defined in (N, S) by some Π0
n formula.
A set is ∆0n relative to S if it is both Σ0
n and Π0n relative to S.
Post’s Theorem holds in relativized form.
In particular, A is ∆01 relative to S iff A is computable relative to S.
![Page 151: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/151.jpg)
Relativizing the Arithmetic Hierarchy
All of this can be relativized to any S ⊆ N:
Consider arithmetic formulas with one free set variable X .
A ⊆ N is defined in (N, S) by ϕ(y ,X) if: k ∈ A iff ϕ(k , S) holds in N.
A set is Σ0n relative to S if it is defined in (N, S) by some Σ0
n formula.
A set is Π0n relative to S if it is defined in (N, S) by some Π0
n formula.
A set is ∆0n relative to S if it is both Σ0
n and Π0n relative to S.
Post’s Theorem holds in relativized form.
In particular, A is ∆01 relative to S iff A is computable relative to S.
![Page 152: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/152.jpg)
Relativizing the Arithmetic Hierarchy
All of this can be relativized to any S ⊆ N:
Consider arithmetic formulas with one free set variable X .
A ⊆ N is defined in (N, S) by ϕ(y ,X) if: k ∈ A iff ϕ(k , S) holds in N.
A set is Σ0n relative to S if it is defined in (N, S) by some Σ0
n formula.
A set is Π0n relative to S if it is defined in (N, S) by some Π0
n formula.
A set is ∆0n relative to S if it is both Σ0
n and Π0n relative to S.
Post’s Theorem holds in relativized form.
In particular, A is ∆01 relative to S iff A is computable relative to S.
![Page 153: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/153.jpg)
RCA0 and Computability
Recall that RCA0 is obtained by restricting:
I comprehension to ∆01-comprehension:
∀n [ϕ(n) ↔ ψ(n)] → ∃X ∀n [n ∈ X ↔ ϕ(n)]
for all ϕ,ψ s.t. ϕ is Σ01 and ψ is Π0
1, and X is not free in ϕ
I induction to Σ01-induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)]) → ∀n ϕ(n)
for all Σ01 formulas ϕ
∆01-comprehension is (relative) computable comprehension.
Indeed, RCA stands for Recursive Comprehension Axiom.
![Page 154: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/154.jpg)
RCA0 and Computability
Recall that RCA0 is obtained by restricting:
I comprehension to ∆01-comprehension:
∀n [ϕ(n) ↔ ψ(n)] → ∃X ∀n [n ∈ X ↔ ϕ(n)]
for all ϕ,ψ s.t. ϕ is Σ01 and ψ is Π0
1, and X is not free in ϕ
I induction to Σ01-induction:
(ϕ(0) ∧ ∀n [ϕ(n) → ϕ(n + 1)]) → ∀n ϕ(n)
for all Σ01 formulas ϕ
∆01-comprehension is (relative) computable comprehension.
Indeed, RCA stands for Recursive Comprehension Axiom.
![Page 155: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/155.jpg)
Models of RCA0
A model in the language of second-order arithmetic consists ofa first-order part N = (N; 0N , 1N , SN , <N ,+N , ·N) and asecond-order part S ⊆ 2N .
If N is the standard natural numbers, we call this an ω-modeland identify it with S.
Thm (Friedman). S is an ω-model of RCA0 iff S is a Turing ideal.
Cor. If RCA0 + P ` Q then P �c Q.
The converse does not always hold because non-ω-models ofRCA0 exist, but it often does.
![Page 156: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/156.jpg)
Models of RCA0
A model in the language of second-order arithmetic consists ofa first-order part N = (N; 0N , 1N , SN , <N ,+N , ·N) and asecond-order part S ⊆ 2N .
If N is the standard natural numbers, we call this an ω-modeland identify it with S.
Thm (Friedman). S is an ω-model of RCA0 iff S is a Turing ideal.
Cor. If RCA0 + P ` Q then P �c Q.
The converse does not always hold because non-ω-models ofRCA0 exist, but it often does.
![Page 157: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/157.jpg)
Models of RCA0
A model in the language of second-order arithmetic consists ofa first-order part N = (N; 0N , 1N , SN , <N ,+N , ·N) and asecond-order part S ⊆ 2N .
If N is the standard natural numbers, we call this an ω-modeland identify it with S.
Thm (Friedman). S is an ω-model of RCA0 iff S is a Turing ideal.
Cor. If RCA0 + P ` Q then P �c Q.
The converse does not always hold because non-ω-models ofRCA0 exist, but it often does.
![Page 158: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/158.jpg)
Models of RCA0
A model in the language of second-order arithmetic consists ofa first-order part N = (N; 0N , 1N , SN , <N ,+N , ·N) and asecond-order part S ⊆ 2N .
If N is the standard natural numbers, we call this an ω-modeland identify it with S.
Thm (Friedman). S is an ω-model of RCA0 iff S is a Turing ideal.
Cor. If RCA0 + P ` Q then P �c Q.
The converse does not always hold because non-ω-models ofRCA0 exist, but it often does.
![Page 159: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/159.jpg)
The Reverse-Mathematical Universe
![Page 160: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/160.jpg)
Mathematics in RCA0
Several theorems can be proved in RCA0, e.g. many basicproperties of the natural numbers and the reals, as well asI the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
But the computable sets form an ω-model of RCA0, so theoremsthat are not computably true cannot be proved in RCA0.
Limited induction also plays a role.
Thm (Yokoyama). BKL is not provable in RCA0.
![Page 161: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/161.jpg)
Mathematics in RCA0
Several theorems can be proved in RCA0, e.g. many basicproperties of the natural numbers and the reals, as well asI the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
But the computable sets form an ω-model of RCA0, so theoremsthat are not computably true cannot be proved in RCA0.
Limited induction also plays a role.
Thm (Yokoyama). BKL is not provable in RCA0.
![Page 162: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/162.jpg)
Mathematics in RCA0
Several theorems can be proved in RCA0, e.g. many basicproperties of the natural numbers and the reals, as well asI the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
But the computable sets form an ω-model of RCA0, so theoremsthat are not computably true cannot be proved in RCA0.
Limited induction also plays a role.
Thm (Yokoyama). BKL is not provable in RCA0.
![Page 163: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/163.jpg)
Mathematics in RCA0
Several theorems can be proved in RCA0, e.g. many basicproperties of the natural numbers and the reals, as well asI the existence of algebraic closures of fieldsI Godel’s Completeness Theorem for theoriesI the Intermediate Value TheoremI the Tietze Extension Theorem for complete separable metric
spaces...
But the computable sets form an ω-model of RCA0, so theoremsthat are not computably true cannot be proved in RCA0.
Limited induction also plays a role.
Thm (Yokoyama). BKL is not provable in RCA0.
![Page 164: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/164.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0. So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 165: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/165.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0. So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 166: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/166.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0. So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 167: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/167.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0. So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 168: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/168.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0.
So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 169: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/169.jpg)
Other Subsystems of Second-Order Arithmetic
ACA0: RCA0 + arithmetic comprehension:
∃X ∀n [n ∈ X ↔ ϕ(n)]
for all arithmetic ϕ s.t. X is not free in ϕ
ACA0 implies arithmetic induction.
A Turing ideal is an ω-model of ACA0 iff it is closed under jumps.
RCA0 + Σ01-comprehension implies ACA0.
KL is equivalent to ACA0 over RCA0. So are
I the existence of maximal ideals for commutative ringsI the existence of bases for vector spacesI the Bolzano-Weierstraß TheoremI the existence of the Turing jump
...
![Page 170: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/170.jpg)
Other Subsystems of Second-Order Arithmetic
WKL0: RCA0 + Weak Konig’s Lemma
WKL0 is arithmetically conservative over RCA0, i.e., if WKL0 provesan arithmetic statement, then so does RCA0.
So WKL0 has the same amount of induction as RCA0.
ω-models of WKL0 are also known as Scott sets.
Equivalents of WKL0
I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
![Page 171: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/171.jpg)
Other Subsystems of Second-Order Arithmetic
WKL0: RCA0 + Weak Konig’s Lemma
WKL0 is arithmetically conservative over RCA0, i.e., if WKL0 provesan arithmetic statement, then so does RCA0.
So WKL0 has the same amount of induction as RCA0.
ω-models of WKL0 are also known as Scott sets.
Equivalents of WKL0
I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
![Page 172: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/172.jpg)
Other Subsystems of Second-Order Arithmetic
WKL0: RCA0 + Weak Konig’s Lemma
WKL0 is arithmetically conservative over RCA0, i.e., if WKL0 provesan arithmetic statement, then so does RCA0.
So WKL0 has the same amount of induction as RCA0.
ω-models of WKL0 are also known as Scott sets.
Equivalents of WKL0
I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
![Page 173: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/173.jpg)
Other Subsystems of Second-Order Arithmetic
WKL0: RCA0 + Weak Konig’s Lemma
WKL0 is arithmetically conservative over RCA0, i.e., if WKL0 provesan arithmetic statement, then so does RCA0.
So WKL0 has the same amount of induction as RCA0.
ω-models of WKL0 are also known as Scott sets.
Equivalents of WKL0
I the uniqueness of algebraic closures for fieldsI the existence of prime ideals for commutative ringsI the Compactness Theorem for first-order logicI the Extreme Value TheoremI Brouwer’s Fixed Point Theorem
...
![Page 174: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/174.jpg)
Other Subsystems of Second-Order Arithmetic
WWKL0: RCA0 + Weak Weak Konig’s Lemma
Equivalents of WWKL0:I the Vitali Covering TheoremI the monotone convergence theorem for Lebesgue measure
on [0, 1]
I the existence of (relatively) Martin-Lof random sequences...
![Page 175: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/175.jpg)
Other Subsystems of Second-Order Arithmetic
ATR0: RCA0 + arithmetic transfinite recursion
Equivalents of ATR0
I comparability of well-orderingsI Ulm’s Theorem on Abelian p-groupsI the Perfect Set Theorem...
Π11-CA0: RCA0 + Π1
1-comprehension
A Π11 formula is one of the form ∀X ϕ, where ϕ is arithmetic.
Equivalents of Π11-CA0
I every countable Abelian group is the direct sum of adivisible group and a reduced group
I the Cantor-Bendixson Theorem...
![Page 176: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/176.jpg)
Other Subsystems of Second-Order Arithmetic
ATR0: RCA0 + arithmetic transfinite recursion
Equivalents of ATR0
I comparability of well-orderingsI Ulm’s Theorem on Abelian p-groupsI the Perfect Set Theorem...
Π11-CA0: RCA0 + Π1
1-comprehension
A Π11 formula is one of the form ∀X ϕ, where ϕ is arithmetic.
Equivalents of Π11-CA0
I every countable Abelian group is the direct sum of adivisible group and a reduced group
I the Cantor-Bendixson Theorem...
![Page 177: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/177.jpg)
Other Subsystems of Second-Order Arithmetic
ATR0: RCA0 + arithmetic transfinite recursion
Equivalents of ATR0
I comparability of well-orderingsI Ulm’s Theorem on Abelian p-groupsI the Perfect Set Theorem...
Π11-CA0: RCA0 + Π1
1-comprehension
A Π11 formula is one of the form ∀X ϕ, where ϕ is arithmetic.
Equivalents of Π11-CA0
I every countable Abelian group is the direct sum of adivisible group and a reduced group
I the Cantor-Bendixson Theorem...
![Page 178: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/178.jpg)
Other Subsystems of Second-Order Arithmetic
ATR0: RCA0 + arithmetic transfinite recursion
Equivalents of ATR0
I comparability of well-orderingsI Ulm’s Theorem on Abelian p-groupsI the Perfect Set Theorem...
Π11-CA0: RCA0 + Π1
1-comprehension
A Π11 formula is one of the form ∀X ϕ, where ϕ is arithmetic.
Equivalents of Π11-CA0
I every countable Abelian group is the direct sum of adivisible group and a reduced group
I the Cantor-Bendixson Theorem...
![Page 179: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/179.jpg)
Relationships between Subsystems of Second-Order Arithmetic
Π11-CA0
↓ATR0
↓ACA0
↓WKL0
↓WWKL0
↓RCA0
![Page 180: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/180.jpg)
Ramsey’s Theorem
[X ]n is the set of n-element subsets of X .
A k-coloring of [X ]n is a map c : [X ]n → k .
A set H ⊆ X is homogeneous for c if |c([H]n)| = 1.
Ramsey’s Theorem for n-tuples and k colors (RTnk ): Every
k-coloring of [N]n has an infinite homogeneous set.
For j, k > 2, RTnj and RTn
k are equivalent over RCA0.
RTn<∞ is ∀k RTn
k and RT is ∀n ∀k RTnk .
![Page 181: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/181.jpg)
Ramsey’s Theorem
[X ]n is the set of n-element subsets of X .
A k-coloring of [X ]n is a map c : [X ]n → k .
A set H ⊆ X is homogeneous for c if |c([H]n)| = 1.
Ramsey’s Theorem for n-tuples and k colors (RTnk ): Every
k-coloring of [N]n has an infinite homogeneous set.
For j, k > 2, RTnj and RTn
k are equivalent over RCA0.
RTn<∞ is ∀k RTn
k and RT is ∀n ∀k RTnk .
![Page 182: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/182.jpg)
Ramsey’s Theorem
[X ]n is the set of n-element subsets of X .
A k-coloring of [X ]n is a map c : [X ]n → k .
A set H ⊆ X is homogeneous for c if |c([H]n)| = 1.
Ramsey’s Theorem for n-tuples and k colors (RTnk ): Every
k-coloring of [N]n has an infinite homogeneous set.
For j, k > 2, RTnj and RTn
k are equivalent over RCA0.
RTn<∞ is ∀k RTn
k and RT is ∀n ∀k RTnk .
![Page 183: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/183.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 184: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/184.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 185: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/185.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 186: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/186.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 187: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/187.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 188: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/188.jpg)
The Reverse Mathematics of Ramsey’s Theorem
Thm (Jockusch/Simpson). For n > 3, RCA0 ` RTn2 ↔ ACA0.
Thm (Seetapun). RCA0 + RT22 0 ACA0.
Thm (Hirst). WKL0 0 RT22.
Thm (Liu). RCA0 + RT22 0 WWKL0.
RCA0 ` RT1k for any k ∈ N, but:
Thm (Hirst). RCA0 0 RT1<∞.
Thm (Jockusch). ACA0 0 RT.
![Page 189: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/189.jpg)
Some consequences of RT22
Ascending / Descending Sequence Principle (ADS): Every infinitelinear order has an infinite ascending or descending sequence.
Chain / Antichain Principle (CAC): Every infinite partial order hasan infinite chain or antichain.
Atomic Model Theorem (AMT): Every complete atomic theoryhas an atomic model.
Existence of Diagonally Nonrecursive Functions (DNR): For everyX , there is a function f s.t. f (e) 6= ΦX
e(e) for all e.
![Page 190: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/190.jpg)
Some consequences of RT22
Ascending / Descending Sequence Principle (ADS): Every infinitelinear order has an infinite ascending or descending sequence.
Chain / Antichain Principle (CAC): Every infinite partial order hasan infinite chain or antichain.
Atomic Model Theorem (AMT): Every complete atomic theoryhas an atomic model.
Existence of Diagonally Nonrecursive Functions (DNR): For everyX , there is a function f s.t. f (e) 6= ΦX
e(e) for all e.
![Page 191: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/191.jpg)
Some consequences of RT22
Ascending / Descending Sequence Principle (ADS): Every infinitelinear order has an infinite ascending or descending sequence.
Chain / Antichain Principle (CAC): Every infinite partial order hasan infinite chain or antichain.
Atomic Model Theorem (AMT): Every complete atomic theoryhas an atomic model.
Existence of Diagonally Nonrecursive Functions (DNR): For everyX , there is a function f s.t. f (e) 6= ΦX
e(e) for all e.
![Page 192: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/192.jpg)
Some consequences of RT22
Ascending / Descending Sequence Principle (ADS): Every infinitelinear order has an infinite ascending or descending sequence.
Chain / Antichain Principle (CAC): Every infinite partial order hasan infinite chain or antichain.
Atomic Model Theorem (AMT): Every complete atomic theoryhas an atomic model.
Existence of Diagonally Nonrecursive Functions (DNR): For everyX , there is a function f s.t. f (e) 6= ΦX
e(e) for all e.
![Page 193: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/193.jpg)
A Small Part of the Universe Between RCA0 and ACA0
RT22
��
��
WKL
��CAC
��
WWKL
��
ADS
��AMT DNR
Combined results of Yu and Simpson; Giusto and Simpson;Ambos-Spies, Kjos-Hanssen, Lempp, and Slaman; Hirschfeldt andShore; Hirschfeldt, Jockusch, Kjos-Hanssen, Lempp, and Slaman;Hirschfeldt, Shore, and Slaman; Liu; and Lerman, Solomon, andTowsner.
![Page 194: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/194.jpg)
A Larger Part of the Universe Between RCA0 and ACA0
CRT22
CADS
AST
ACA
SRAM
BSig2+Pi01G
POS+WWKL
FS3 RT22+WKL+RRT32
SRT22 ASRAM
Pi01G
ISig2
ISig2+AMT
WWKL2
POS
RRT32
FS2
RT22
CAC+WKL
RCA
BSig2+RRT22 POS1 RAN2 DTCp POS2 BSig2+RAN2
BSig2
DNR0
RWWKL
RAN1 WWKL
PHPM
SCAC
SEM
RWKL ASRT22 SPT22 SEM+SADS D22 SIPT22
SADS
AMT
FIP
nD2IP
OPT
CAC
ADS SCAC+CCAC
StCOH SADS+CADS CCAC
PART RT12
COH
RCOLOR2
BSig2+COH+RRT22
StCRT22 StCADS BSig2+COH CRT22+BSig2 BSig2+CADS
COH+WKL
WKL
RWWKL1 RRT22
DNR
EM
IPT22
RWKL1 EM+ADS SRT22+COH PT22
EM+BSig2
P22
TS2
STS2 RCOLOR3
![Page 195: Tutorial Series on Reverse Mathematics Denis R. …Tutorial Series on Reverse Mathematics Denis R. Hirschfeldt — University of Chicago 2017 NZMRI Summer School, Napier, New Zealand](https://reader034.vdocument.in/reader034/viewer/2022042212/5eb4bdfd9d48ae76527fdded/html5/thumbnails/195.jpg)
Tutorial Series on Reverse Mathematics
Denis R. Hirschfeldt — University of Chicago
2017 NZMRI Summer School, Napier, New Zealand