scientific article; zbMATH DE number 3083488

Publication date: 1953

Full work available at URL: https://eudml.org/doc/219317

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

foundations of mathematics, philosophy, logic

Related Items (only showing first 100 items - show all)

Operation of bound prefix concatenation and finite superposition bases ⋮ Computation models and function algebras ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability ⋮ Characterizing time computational complexity classes with polynomial differential equations ⋮ Bounded iteration and unary functions ⋮ A universal two-way automaton ⋮ On quasi-universal word functions ⋮ The Church-Rosser theorem and quantitative analysis of witnesses ⋮ Relativization of a primitive recursive hierarchy ⋮ Context-free languages and rudimentary attributes ⋮ Super-exponentials nonprimitive recursive, but rudimentary ⋮ Some observations on the connection between counting and recursion ⋮ A generalized Grzegorczyk hierarchy and low complexity classes ⋮ Existence of superposition bases in countable primitively recursively closed classes ⋮ Natural Numbers and Infinitesimals ⋮ Unnamed Item ⋮ Hierarchies of number-theoretic functions. I ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Rekursionszahlen und die Grzegorczyk-Hierarchie ⋮ A note on discreteness and virtuality in analog computing ⋮ Darstellungen der (im KALMÁR-CSILLAG'schen Sinne) Elementaren Funktionen ⋮ The intrinsic difficulty of recursive functions ⋮ Rudimentary relations and primitive recursion: A toolbox ⋮ A classification of the ordinal recursive functions ⋮ Subrecursiveness: Machine-independent notions of computability in restricted time and storage ⋮ Continued fractions of primitive recursive real numbers ⋮ Nondeterministic stack register machines ⋮ THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY ⋮ A method for constructing maximal subalgebras of algebras of general recursive functions ⋮ A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ Unnamed Item ⋮ Contribution of Warsaw logicians to computational logic ⋮ A New Hierarchy of Elementary Functions ⋮ McNaughton families of languages. ⋮ Natural well-orderings ⋮ Pure Iteration and Periodicity ⋮ Hierarchien primitiv-rekursiver Funktionen im Transfiniten ⋮ How to prove that two classes of simple primitive recursive functions are distinct ⋮ A maximal sequence of classes transformable by primitive recursion in a given class ⋮ Hierarchies of operators in constructive metric spaces ⋮ Equational calculi for Grzegorczyk's classes \(\mathcal E^n\) ⋮ Characterization of the Relations in Grzegorczyk's Hierarchy Revisited ⋮ Über die mit Stackautomaten berechenbaren Funktionen ⋮ Jede mit Stackautomaten berechenbare Funktion ist elementar ⋮ Some Hierarchies of Primitive Recursive Functions on Term Algebras ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Andrzej Grzegorczyk, a Logician Par Excellence ⋮ A superposition basis in the class of Kalmar elementary functions ⋮ Existence of infinite bases with respect to superposition in certain classes of one-place functions ⋮ On a complexity-based way of constructivizing the recursive functions ⋮ Positive rudimentarity of the graphs of Ackermann and Grzegorczyk ⋮ Unnamed Item ⋮ Combinatorial principles in elementary number theory ⋮ On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic ⋮ Unnamed Item ⋮ Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus ⋮ Bounded prefix concatenation operation and finite bases with respect to the superposition ⋮ A formal system of reduction paths for parallel reduction ⋮ Subrecursive hierarchies on Scott domains ⋮ The Garland Measure and Computational Complexity of Stack Programs ⋮ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ A classification of an iterative hierarchy ⋮ Bounded functional interpretation ⋮ Predicative logic and formal arithmetic ⋮ Augmented loop languages and classes of computable functions ⋮ Elementary Skolem functions ⋮ On primitive recursive wordfunctions ⋮ Control structures in programs and computational complexity ⋮ Representation of partial recursive functions with certain conditions in the form of superpositions ⋮ Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar ⋮ Bounded monotone recursion and multihead automata ⋮ On the density of honest subrecursive classes ⋮ On computational reducibility ⋮ A recursive and a grammatical characterization of the exponential-time languages ⋮ Recognition of invariant properties of algorithms ⋮ Properties of graphs of functions in the Grzegorczyk hierarchy ⋮ On languages specified by relative acceptance ⋮ On subrecursive complexity of integration ⋮ A simple syntactic definition of all classes of the Grzegorczyk hierarchy ⋮ A specification of parallel problems ⋮ The typed lambda-calculus is not elementary recursive ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) ⋮ Classification of computably approximable real numbers ⋮ On the representation of partial recursive functions as superpositions ⋮ On the complexity of the identity problem for finitely defined groups ⋮ Complexity Hierarchies beyond Elementary ⋮ Subrecursive programming languages. II. On program size ⋮ On the computational complexity of imperative programming languages ⋮ Algorithmic sequences from the initial class of the Grzegorczyk hierarchy ⋮ Grzegorczyk's hierarchy of computable analysis ⋮ The primitive recursive analysis of ordinary differential equations and the complexity of their solutions ⋮ Feasible functionals and intersection of ramified types ⋮ Finite complete rewriting systems and the complexity of word problem ⋮ Classes of Predictably Computable Functions ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ An inherently iterative algorithm for the Grzegorczyk hierarchy ⋮ Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability ⋮ Complexity results on the conjugacy problem for monoids

This page was built for publication: