scientific article; zbMATH DE number 3247155
From MaRDI portal
Publication:5533181
Cited in
(38)- A constructive consistency proof of a fragment of set theory
- Ordinal recursive bounds for Higman's theorem
- Mechanizing structural induction. I: Formal system
- The first example of a recursive function which is not primitive recursive
- Pre-recursive categories
- Modal functions for concise definition of state machines and products
- Fast growing functions based on Ramsey theorems
- Characterizing complexity classes by higher type primitive recursive definitions
- On the density of honest subrecursive classes
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Maximal machine learnable classes
- Induction rules, reflection principles, and provably recursive functions
- Unification of infinite sets of terms schematized by primal grammars
- A model for iterative computation
- A characterisation of multiply recursive functions with Higman's lemma.
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- Complexity of the calculus of continued fraction representation of real numbers
- Cartesian categories with natural numbers object
- A class of recursive permutations which is primitive recursive complete
- Coloring number and on-line Ramsey theory for graphs and hypergraphs
- Book review of: B. Steffen et al., Mathematical foundations of advanced informatics. Volume 1. Inductive approaches
- Approximation and complexity of functions on the integers
- Subrecursive programming languages. II. On program size
- A note on comparison of subrecursive hierarchies
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
- scientific article; zbMATH DE number 3443638 (Why is no real title available?)
- An ordinal calculus for proving termination in term rewriting
- Strictly orthogonal left linear rewrite systems and primitive recursion
- An ordinal measure based procedure for termination of functions
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Term rewriting theory for the primitive recursive functions
- Tight length theorems for multiset extensions of Higman's lemma
- Computational considerations on the representation of number-theoretic functions by arithmetic terms
- State machines for large scale computer software and systems
- Linearizing well quasi-orders and bounding the length of bad sequences
- Reduction of higher type levels by means of an ordinal analysis of finite terms
- The core can be accessed with a bounded number of blocks
- Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5533181)
