- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Intrinsically Hyperarithmetical Sets
Mathematical Logic Quarterly 42 (1):469-480 (1996)
Abstract
The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtainedMy notes
Similar books and articles
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
Analytics
Added to PP
2013-12-01
Downloads
90 (#601,233)
6 months
53 (#161,616)
2013-12-01
Downloads
90 (#601,233)
6 months
53 (#161,616)
Historical graph of downloads
Citations of this work
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
Π 1 1 relations and paths through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Degree spectra of relations on computable structures in the presence of Δ 2 0 isomorphisms.Denis R. Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697-720.
Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Elementary induction on abstract structures.Yiannis Nicholas Moschovakis - 1974 - Mineola, N.Y.: Dover Publications.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Yiannis N. Moschovakis. Elementary induction on abstract structures. Studies in logic and the foundations of mathematics, vol. 77. North-Holland Publishing Company, Amsterdam and London, and American Elsevier Publishing Company, Inc., New York, 1974, x + 218 pp.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation