- 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 presentedLinks
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
Enumerations of Turing ideals with applications.David Marker - 1990 - Notre Dame Journal of Formal Logic 31 (4):509-514.
On regular modal logics with axiom □ ⊤ → □□ ⊤.Kazimierz Świrydowicz - 1990 - Studia Logica 49 (2):171 - 174.
A tableau calculus with automaton-labelled formulae for regular grammar logics.Rajeev Gore - unknown
Full reflection at a measurable cardinal.Thomas Jech & Jiří Witzany - 1994 - Journal of Symbolic Logic 59 (2):615-630.
Deciding regular grammar logics with converse through first-order logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
The cofinality spectrum of the infinite symmetric group.Saharon Shelah & Simon Thomas - 1997 - Journal of Symbolic Logic 62 (3):902-916.
Default nominal inflection in Hebrew: evidence for mental variables.Joseph Shimron, Iris Berent & Stephen Pinker - 1999 - Cognition 72 (1):1-44.
Analytics
Added to PP
2009-01-28
Downloads
25 (#598,332)
6 months
5 (#544,079)
2009-01-28
Downloads
25 (#598,332)
6 months
5 (#544,079)
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
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
Server: philpapers-web-7c76586df8-pp8v9 uwo