The following pages link to (Q3325707):
Displaying 50 items.
- Szemerédi's regularity lemma via martingales (Q311501) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- Streamlined subrecursive degree theory (Q408165) (← links)
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
- Bounds on trees (Q626851) (← links)
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) (Q685068) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Modular tree transducers (Q807012) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Finitely stratified polymorphism (Q1175334) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Minimum-complexity pairing functions (Q1201876) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- Critical points in an algebra of elementary embeddings (Q1314541) (← links)
- On bimodal logics of provability (Q1332858) (← links)
- Elementary descent recursion and proof theory (Q1344279) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Elementary realizability (Q1362589) (← links)
- Dispensing with the continuum (Q1368388) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Sometimes slow growing is fast growing (Q1377604) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- Linear logic and elementary time (Q1401946) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- On Brouwer's continuity principle (Q1788331) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- Notations for exponentiation. (Q1853509) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Souslin partitions of products of finite sets (Q1874465) (← links)
- Iterated local reflection versus iterated consistency (Q1899141) (← links)
- Elementary functions and loop programs (Q1903128) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- An algebraic treatment of quantifier-free systems of arithmetic (Q1915125) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Things that can and things that cannot be done in PRA (Q1971796) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
