Primitive recursive selection functions for existential assertions over abstract algebras

DOI10.1016/j.jlap.2008.02.002zbMath1156.03043OpenAlexW1974374936MaRDI QIDQ941429

Thomas Strahm, Jeffery Zucker

Publication date: 1 September 2008

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/37285/1/sz08.pdf

zbMATH Keywords

realizabilityselection functiongeneralized computability

Mathematics Subject Classification ID

Related Items (1)

Primitive recursion in the abstract

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof-theoretic characterization of the basic feasible functionals
• Computation by `While' programs on topological partial algebras
• A foundational delineation of poly-time
• Polytime, combinatory logic and positive safe induction
• Theories with self-application and computational complexity.
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• Remarks on Herbrand normal forms and Herbrand realizations
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Quantifier-free and one-quantifier systems
• Herbrand analyses
• Abstract versus concrete computation on metric partial algebras
• On n-quantifier induction
• Abstract computability and algebraic specification
• On the interpretation of intuitionistic number theory
• Logical Approaches to Computational Barriers
• Proof theory

This page was built for publication: Primitive recursive selection functions for existential assertions over abstract algebras