A representation of recursively enumerable sets through Horn formulas in higher recursion theory

DOI10.1007/s10998-016-0148-xzbMath1389.03008OpenAlexW2467957161MaRDI QIDQ1677584

Julio E. Solís Daun, Juan A. Nido Valencia, Luis Miguel Villegas Silva

Publication date: 10 November 2017

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-016-0148-x

zbMATH Keywords

recursively enumerable setHorn theoryprimitive recursive set functions\(\alpha\)-recursion theory\(\beta\)-recursionadmissible recursionprimitive recursively closed ordinals

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Logic on admissible sets (03C70) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

Weak- and strong-type inequality for the cone-like maximal operator in variable Lebesgue spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordinal machines and admissible recursion theory
• Fundamentals of generalized recursion theory
• Infinite time Turing machines
• Infinitary logic and admissible sets
• The fine structure of the constructible hierarchy