The following pages link to (Q3325707):
Displaying 50 items.
- Dedekind cuts and long strings of zeros in base expansions (Q2117788) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Computable irrational numbers with representations of surprising complexity (Q2216036) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas (Q2449854) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Herbrand analyses (Q2641297) (← links)
- (Q2776806) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Natural Numbers and Infinitesimals (Q2909760) (← links)
- Continued fractions of primitive recursive real numbers (Q2947235) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Sub-computabilities (Q3088295) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- The Monotone Completeness Theorem in Constructive Reverse Mathematics (Q3305629) (← links)
- Classifying the Provably Total Functions of PA (Q3430936) (← links)
- Undecidable complexity statements in -arithmetic (Q3480020) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Primitive Recursive Bounds for Van Der Waerden Numbers (Q3794188) (← links)
- A time-space hierarchy between polynomial time and polynomial space (Q4000863) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- A jump operator for subrecursion theories (Q4262563) (← links)
- Machine learning of higher-order programs (Q4302347) (← links)
- A Uniform Approach to Fundamental Sequences and Hierarchies (Q4304112) (← links)
- Strictly primitive recursive realizability, I (Q4323037) (← links)
- Characterization of the Relations in Grzegorczyk's Hierarchy Revisited (Q4333472) (← links)
- Some Hierarchies of Primitive Recursive Functions on Term Algebras (Q4336703) (← links)
- A Model-Theoretic Approach to Ordinal Analysis (Q4338039) (← links)
- Proof Theoretic Analysis by Iterated Reflection (Q4637223) (← links)
- Minimal readability of intuitionistic arithmetic and elementary analysis (Q4876321) (← links)
- How to characterize provably total functions by local predicativity (Q4879900) (← links)
- Bimodal logics for extensions of arithmetical theories (Q4879903) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- A Refinement of the μ-measure for Stack Programs (Q4916234) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- The complexity of decision procedures in relevance logic II (Q4948542) (← links)
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian (Q4992044) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- (Q5101339) (← links)
- Monomial ideals and independence of (Q5108088) (← links)
- An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem (Q5108709) (← links)
- The Ackermann functions are not optimal, but by how much? (Q5190202) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)
- Corrigendum to Reducing ω-model reflection to iterated syntactic reflection (Q6132767) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
