scientific article; zbMATH DE number 1215495
From MaRDI portal
Publication:4215632
zbMath0961.03053MaRDI QIDQ4215632
Stanley S. Wainer, Matt Fairtlough
Publication date: 26 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (26)
A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Reverse mathematical bounds for the termination theorem ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ Short proofs for slow consistency ⋮ Unnamed Item ⋮ Mining the surface: witnessing the low complexity theorems of arithmetic ⋮ Predicatively unprovable termination of the Ackermannian Goodstein process ⋮ A WALK WITH GOODSTEIN ⋮ The provably total NP search problems of weak second order bounded arithmetic ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ Things that can and things that cannot be done in PRA ⋮ A note on iterated consistency and infinite proofs ⋮ Parameter-free polymorphic types ⋮ Proof lengths for instances of the Paris-Harrington principle ⋮ Degrees of relative provability ⋮ Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem ⋮ Elementary arithmetic ⋮ A meaning based information theory - informalogical space: basic concepts and convergence of information sequences ⋮ Ackermann's substitution method (remixed) ⋮ GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION ⋮ Complexity Hierarchies beyond Elementary ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension ⋮ Inductive definitions over a predicative arithmetic ⋮ A decidable characterization of the classes between lintime and exptime ⋮ Partitioning 𝛼–large sets: Some lower bounds
This page was built for publication:
