Rudimentary relations and primitive recursion: A toolbox
From MaRDI portal
Recommendations
- Primitive recursive equivalence relations and their primitive recursive complexity
- On rudimentarity, primitive recursivity and representability
- Primitive recursion and \(\mu\)-recursivity
- Primitive recursion, equality, and a universal set
- Rudimentary recursion, gentle functions and provident sets
- The realm of primitive recursion
- A proof-theoretic account of primitive recursion and primitive iteration
- Elementary descent recursion and proof theory
- On the Algebraic Structure of Primitive Recursive Functions
- scientific article; zbMATH DE number 1300970
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 704020 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Classes of Predictably Computable Functions
- Context-free languages and rudimentary attributes
- Counting $Δ_0$ sets
- Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
- Overspill and fragments of arithmetic
- Rudimentary Languages and Second‐Order Logic
- Rudimentary Predicates and Relative Computation
- Small Grzegorczyk Classes
- Small Grzegorczyk classes and limited minimum
- Super-exponentials nonprimitive recursive, but rudimentary
- The polynomial-time hierarchy
- Theory of Formal Systems. (AM-47)
Cited in
(12)- Bounded minimalisation and bounded counting in argument-bounded idc's
- scientific article; zbMATH DE number 704020 (Why is no real title available?)
- The role of rudimentary relations in complexity theory
- On the polynomial computability of some rudimentary predicates.
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- Fifty years of the spectrum problem: survey and new results
- Extensions of MSO and the monadic counting hierarchy
- Arithmetical definability and computational complexity
- On rudimentarity, primitive recursivity and representability
- Reachability in fixed VASS: expressiveness and lower bounds
- Counting modulo finite semigroups
- Nonerasing, counting, and majority over the linear time hierarchy
This page was built for publication: Rudimentary relations and primitive recursion: A toolbox
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127532)
