The realm of primitive recursion
From MaRDI portal
Recommendations
Cites work
Cited in
(28)- Pointwise transfinite induction and a miniaturized predicativity
- scientific article; zbMATH DE number 23837 (Why is no real title available?)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- An arithmetic for polynomial-time computation
- A note on complexity measures for inductive classes in constructive type theory
- Tiered arithmetics
- Analysing the implicit complexity of programs.
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Higher type recursion, ramification and polynomial time
- Functions over free algebras definable in the simply typed lambda calculus
- Build your own clarithmetic. I: Setup and completeness
- Characterizing parallel time by type 2 recursions with polynomial output length
- A characterization of alternating log time by ramified recurrence
- A new “feasible” arithmetic
- Dependency Pairs and Polynomial Path Orders
- A new order-theoretic characterisation of the polytime computable functions
- Rudimentary relations and primitive recursion: A toolbox
- Tiering as a Recursion Technique
- Unification of infinite sets of terms schematized by primal grammars
- Implicit characterizations of FPTIME and NC revisited
- Recursion Schemata for NC k
- Intrinsic theories and computational complexity
- The Recursive Core
- On the computational complexity of imperative programming languages
- Implicit recursion-theoretic characterizations of counting classes
- Separating NC along the \(\delta\) axis
- Term rewriting theory for the primitive recursive functions
- Primitive recursive real numbers
This page was built for publication: The realm of primitive recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112020)
