Abstract
We study the complexity of computable and Σ\(_{\rm 1}^{\rm 0}\) inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ\(_{\rm 1}^{\rm 0}\)-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ\(_{\rm 1}^{\rm 0}\)-definitions which are computable. We also examine the complexity of new type of inductive definition which we call weakly finitary monotone inductive definitions. Applications are given in proof theory and in logic programming.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cenzer, D., Marek, W., Remmel, J.B.: Using logic programs to reason about infinite sets. In: Proceedings of the Symposium on Mathematics and Artificial Intelligence (AIM 2004) (2004), http://rutcor.rutgers.edu/~amai/aimath04
Cenzer, D., Marek, W., Remmel, J.B.: Logic programming with snfinite sets. Annals of Mathematics and Artificial Intelligence (to appear)
Cenzer, D., Remmel, J.B.: Index sets in computable analysis. Theoretical Computer Science 219, 111–150 (1999)
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Kowalski, R., Bowen (eds.) ICLP 1988, pp. 1070–1080 (1988)
Hinman, P.G.: Recursion-Theoretic Hierarchies. Springer, Heidelberg (1978)
Soare, R.E.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cenzer, D., Remmel, J.B. (2005). The Complexity of Inductive Definability. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_11
Download citation
DOI: https://doi.org/10.1007/11494645_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)