Ordinal definability in the rank hierarchy

Annals of Mathematical Logic 6 (1):1 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(73)90002-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.
Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.
The Steel hierarchy of ordinal valued Borel mappings.J. Duparc - 2003 - Journal of Symbolic Logic 68 (1):187-234.
Review: Kenneth McAloon, On the Sequence of Models $operatorname{HOD}_n$; Thomas J. Jech, Forcing with Trees and Ordinal Definability; Wlodzimierz Zadrozny, Iterating Ordinal Definability. [REVIEW]Rene David - 1987 - Journal of Symbolic Logic 52 (2):570-571.
P-hierarchy on β ω.Andrzej Starosolski - 2008 - Journal of Symbolic Logic 73 (4):1202-1214.
On the plurality of gods.Eric Steinhart - 2013 - Religious Studies 49 (3):289-312.
Γ0 May Be Minimal Subrecursively Inaccessible.Andreas Weiermann - 2001 - Mathematical Logic Quarterly 47 (3):397-408.
On Wainer's notation for a minimal subrecursive inaccessible ordinal.Noriya Kadota - 1993 - Mathematical Logic Quarterly 39 (1):217-227.
Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
A notation system for ordinal using ψ‐functions on inaccessible mahlo numbers.Helmut Pfeiffer & H. Pfeiffer - 1992 - Mathematical Logic Quarterly 38 (1):431-456.
Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
A model and its subset.Ludomir Newelski - 1992 - Journal of Symbolic Logic 57 (2):644-658.
On the Cantor-bendixon rank of recursively enumerable sets.Peter Cholak & Rod Downey - 1993 - Journal of Symbolic Logic 58 (2):629-640.
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2012 - Mathematical Logic Quarterly 58 (4-5):366-376.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.

Analytics

Added to PP
2014-01-17

Downloads
16 (#855,572)

6 months
8 (#292,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
On the Semantics of the Constructible Levels.George Boolos - 1970 - Mathematical Logic Quarterly 16 (2):139-148.
An Undecidable Arithmetical Statement.Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (2):118-119.
Some applications of model theory in set theory.Jack H. Silver - 1971 - Annals of Mathematical Logic 3 (1):45.

View all 9 references / Add more references