The following pages link to (Q5533181):
Displaying 35 items.
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- The core can be accessed with a bounded number of blocks (Q861830) (← links)
- Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers (Q941316) (← links)
- A constructive consistency proof of a fragment of set theory (Q1080422) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- Mechanizing structural induction. I: Formal system (Q1134540) (← links)
- The first example of a recursive function which is not primitive recursive (Q1135847) (← links)
- Pre-recursive categories (Q1164127) (← links)
- Modal functions for concise definition of state machines and products (Q1183435) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- A model for iterative computation (Q1393938) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Complexity of the calculus of continued fraction representation of real numbers (Q1814099) (← links)
- Cartesian categories with natural numbers object (Q1822604) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- Coloring number and on-line Ramsey theory for graphs and hypergraphs (Q2149488) (← links)
- Book review of: B. Steffen et al., Mathematical foundations of advanced informatics. Volume 1. Inductive approaches (Q2335952) (← links)
- Approximation and complexity of functions on the integers (Q2542988) (← links)
- Subrecursive programming languages. II. On program size (Q2546770) (← links)
- A note on comparison of subrecursive hierarchies (Q2551316) (← links)
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259) (← links)
- (Q4769049) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
- Strictly orthogonal left linear rewrite systems and primitive recursion (Q5935986) (← links)
- An ordinal measure based procedure for termination of functions (Q5940917) (← links)
- Algorithmic economics: incomputability, undecidability and unsolvability in economics (Q6599288) (← links)
