Pages that link to "Item:Q3966112"
From MaRDI portal
The following pages link to Accessible Independence Results for Peano Arithmetic (Q3966112):
Displaying 50 items.
- Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal (Q408160) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- On Gödel incompleteness and finite combinatorics (Q581400) (← links)
- Independence results in formal topology (Q651321) (← links)
- Degrees of relative provability (Q691125) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Some nonstandard Ramsey like applications (Q798332) (← links)
- Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator) (Q913788) (← links)
- Too naturalist and not naturalist enough: Reply to Horsten (Q954789) (← links)
- Phase transitions for Gödel incompleteness (Q1006619) (← links)
- How recent work in mathematical logic relates to the foundations of mathematics (Q1085151) (← links)
- An independence result for \((\Pi^ 1_ 1-CA)+BI\) (Q1097882) (← links)
- Termination of rewriting (Q1098624) (← links)
- Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (Q1110524) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Unprovable combinatorial statements (Q1201266) (← links)
- Set theory -- from Cantor's heaven to the first theory among equals (Q1279498) (← links)
- Reverse mathematics and its meaning (Q1312709) (← links)
- A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. (Q1399971) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- The first-order syntax of variadic functions (Q1934953) (← links)
- Pure \(\Sigma_2\)-elementarity beyond the core (Q2041963) (← links)
- A metasemantic challenge for mathematical determinacy (Q2054113) (← links)
- Ackermannian Goodstein sequences of intermediate growth (Q2106602) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- Complexity among the finitely generated subgroups of Thompson's group (Q2233682) (← links)
- Ackermann and Goodstein go functorial (Q2234350) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Die another day (Q2272192) (← links)
- Gödel, Gentzen, Goodstein: the magic sound of a G-string (Q2341287) (← links)
- On the structure of the degrees of relative provability (Q2351755) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- On understanding understanding (Q2713338) (← links)
- Independence of Ramsey theorem variants using $\varepsilon _0$ (Q2789881) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS (Q2856020) (← links)
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375) (← links)
- Another Use of Set Theory (Q3128480) (← links)
- Ranked partial structures (Q4650273) (← links)
- INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES (Q4692078) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION (Q4959664) (← links)
- (Q5046965) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- (Q5111307) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- The Π21$\Pi ^1_2$ consequences of a theory (Q6176438) (← links)
