Elementary functions and loop programs

DOI10.1305/ndjfl/1040408609zbMath0831.03021OpenAlexW2072243664MaRDI QIDQ1903128

Zlatan Damnjanovic

Publication date: 20 February 1996

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040408609

zbMATH Keywords

rudimentary predicatesclassification of LOOP programs of limited complexityhierarchy of elementary predicateshierarchy of Kalmàr elementary functions on integers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Related Items (1)

Elementary realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive rudimentarity of the graphs of Ackermann and Grzegorczyk
• Elementary realizability
• Theory of Formal Systems. (AM-47)
• Classes of Predictably Computable Functions
• The Structure of Loop Programs and Subrecursive Hierarchies
• The bounded arithmetic hierarchy
• The Equivalence of Different Hierarchies of Elementary Functions
• Subrecursive Programming Languages, Part I
• Concatenation as a basis for arithmetic

This page was built for publication: Elementary functions and loop programs