Pages that link to "Item:Q3966112"
From MaRDI portal
The following pages link to Accessible Independence Results for Peano Arithmetic (Q3966112):
Displaying 50 items.
- 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)
- On some slowly terminating term rewriting systems (Q3466405) (← links)
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees (Q3731598) (← links)
- An Unprovable Ramsey-Type Theorem (Q4031465) (← links)
- A modified sentence unprovable in <b>PA</b> (Q4323034) (← links)
- Completeness and categoricity: Frege, gödel and model theory (Q4373014) (← links)
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 (Q4432544) (← links)
- Ranked partial structures (Q4650273) (← links)
- INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES (Q4692078) (← links)
- Extensions of arithmetic for proving termination of computations (Q4732468) (← links)
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods (Q4750638) (← links)
- Logical dreams (Q4804133) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION (Q4959664) (← links)
- (Q5009706) (← links)
- A Glimpse of $$ \sum_{3} $$-elementarity (Q5013913) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- (Q5046965) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- (Q5101339) (← links)
- (Q5111307) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- (Q5155451) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- (Q5227521) (← links)
- Zeno, Hercules, and the Hydra (Q5277917) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
- Laver's results and low-dimensional topology (Q5964930) (← links)
- The Π21$\Pi ^1_2$ consequences of a theory (Q6176438) (← links)
