Degrees of nonrecursive presentability
HTML articles powered by AMS MathViewer
- by Lawrence Feiner PDF
- Proc. Amer. Math. Soc. 38 (1973), 621-624 Request permission
Abstract:
We prove that every $0’$’-recursive binary relation of natural numbers is isomorphic to a recursive relation restricted to a co-r.e. subset of its domain. We use this result to define and discuss “degrees of nonrecursive presentability."References
- L. Feiner, The strong homogeneity conjecture, J. Symbolic Logic 35 (1970), 375–377. MR 286655, DOI 10.2307/2270693
- Lawrence Feiner, Hierarchies of Boolean algebras, J. Symbolic Logic 35 (1970), 365–374. MR 282805, DOI 10.2307/2270692 —, Models of the theory of equality, Notices Amer. Math. Soc. 15 (1968), 399. Abstract #68T-335.
- R. O. Gandy, Proof of Mostowski’s conjecture, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 8 (1960), 571–575 (English, with Russian summary). MR 126383 H. Putnam, Arithmetic models for consistent formulae of quantification theory, J. Symbolic Logic 22 (1957), 110-111.
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 38 (1973), 621-624
- MSC: Primary 02F30; Secondary 02F35
- DOI: https://doi.org/10.1090/S0002-9939-1973-0327494-8
- MathSciNet review: 0327494