scientific article; zbMATH DE number 3247155
From MaRDI portal
Publication:5533181
zbMATH Open0154.00601MaRDI QIDQ5533181FDOQ5533181
Authors: R. Politzer 
Publication date: 1967
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20)
Cited In (35)
- A model for iterative computation
- A class of recursive permutations which is primitive recursive complete
- A characterisation of multiply recursive functions with Higman's lemma.
- Induction rules, reflection principles, and provably recursive functions
- Book review of: B. Steffen et al., Mathematical foundations of advanced informatics. Volume 1. Inductive approaches
- A note on comparison of subrecursive hierarchies
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- An ordinal calculus for proving termination in term rewriting
- Cartesian categories with natural numbers object
- On the density of honest subrecursive classes
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Characterizing complexity classes by higher type primitive recursive definitions
- Approximation and complexity of functions on the integers
- The first example of a recursive function which is not primitive recursive
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Mechanizing structural induction. I: Formal system
- Linearizing well quasi-orders and bounding the length of bad sequences
- Title not available (Why is that?)
- Pre-recursive categories
- Ordinal recursive bounds for Higman's theorem
- Reduction of higher type levels by means of an ordinal analysis of finite terms
- Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
- Unification of infinite sets of terms schematized by primal grammars
- Modal functions for concise definition of state machines and products
- Strictly orthogonal left linear rewrite systems and primitive recursion
- Maximal machine learnable classes
- A constructive consistency proof of a fragment of set theory
- Subrecursive programming languages. II. On program size
- Complexity of the calculus of continued fraction representation of real numbers
- Coloring number and on-line Ramsey theory for graphs and hypergraphs
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
- Fast growing functions based on Ramsey theorems
- Term rewriting theory for the primitive recursive functions
- An ordinal measure based procedure for termination of functions
- The core can be accessed with a bounded number of blocks
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)
