- 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
Regular enumerations
Journal of Symbolic Logic 67 (4):1323-1343 (2002)
Abstract
In the paper we introduce and study regular enumerations for arbitrary recursive ordinals. Several applications of the technique are presentedOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Some effectively infinite classes of enumerations.Sergey Goncharov, Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 60 (3):207-235.
Enumerations of Turing ideals with applications.David Marker - 1990 - Notre Dame Journal of Formal Logic 31 (4):509-514.
Regular Ordinals and Normal Forms.David Isles, A. Kino, J. Myhill & R. E. Vesley - 1973 - Journal of Symbolic Logic 38 (2):334-335.
BERGER, U., Total sets and objects in domain theory DOWNEY, R., Every recursive boolean algebra is isomorphic to one with incomplete atoms GONCHAREV, S., YAKHNIS, A. and YAKHNIS, V., Some effectively infinite classes of enumerations. [REVIEW]P. Lincoln, A. Scedrov & N. Shankar - 1993 - Annals of Pure and Applied Logic 60:291.
Nonstandard characterisations of tensor products and monads in the theory of ultrafilters.Lorenzo Luperi Baglini - 2019 - Mathematical Logic Quarterly 65 (3):347-369.
Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM.Osamu Takaki - 2005 - Archive for Mathematical Logic 44 (6):689-709.
The Amalgamation Property in the Variety of Regular Double Stone Algebras: A Constructive View.Antonio Ledda, Hanamantagouda P. Sankappanavar & Gandolfo Vergottini - 2026 - Bulletin of the Section of Logic 55 (1):1-47.
A hierarchy of filters on regular uncountable cardinals.Thomas Jech - 1987 - Journal of Symbolic Logic 52 (2):388-395.
Analytics
Added to PP
2009-01-28
Downloads
134 (#331,687)
6 months
26 (#366,767)
2009-01-28
Downloads
134 (#331,687)
6 months
26 (#366,767)
Historical graph of downloads
Citations of this work
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
Maximal Arithmetical Reducibilities.John Case - 1974 - Mathematical Logic Quarterly 20 (13‐18):261-270.
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