scientific article; zbMATH DE number 3247155
From MaRDI portal
Publication:5533181
zbMath0154.00601MaRDI QIDQ5533181
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
A constructive consistency proof of a fragment of set theory, Coloring number and on-line Ramsey theory for graphs and hypergraphs, Induction rules, reflection principles, and provably recursive functions, The core can be accessed with a bounded number of blocks, 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, 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., Pre-recursive categories, Unnamed Item, Modal functions for concise definition of state machines and products, Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers, Term rewriting theory for the primitive recursive functions, Fast growing functions based on Ramsey theorems, Characterizing complexity classes by higher type primitive recursive definitions, A class of recursive permutations which is primitive recursive complete, Strictly orthogonal left linear rewrite systems and primitive recursion, An ordinal measure based procedure for termination of functions, On the density of honest subrecursive classes, Linearizing well quasi-orders and bounding the length of bad sequences, Complexity of the calculus of continued fraction representation of real numbers, Approximation and complexity of functions on the integers, Reduction of higher type levels by means of an ordinal analysis of finite terms, Subrecursive programming languages. II. On program size, Cartesian categories with natural numbers object, A note on comparison of subrecursive hierarchies, Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems, Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity, Book review of: B. Steffen et al., Mathematical foundations of advanced informatics. Volume 1. Inductive approaches, Maximal machine learnable classes, An ordinal calculus for proving termination in term rewriting
