A partially non-proper ordinal beyond L

Annals of Pure and Applied Logic 163 (9):1309-1321 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2012.02.003

Links

PhilArchive



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

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

Proper classes via the iterative conception of set.Mark F. Sharlow - 1987 - Journal of Symbolic Logic 52 (3):636-650.
Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Ordinal analysis by transformations.Henry Towsner - 2009 - Annals of Pure and Applied Logic 157 (2-3):269-280.
Σ 1 -elementarity and Skolem hull operators.Gunnar Wilken - 2007 - Annals of Pure and Applied Logic 145 (2):162-175.
On Ordinal Utility, Cardinal Utility and Random Utility.Richard Batley - 2008 - Theory and Decision 64 (1):37-63.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Reverse Mathematics and Ordinal Multiplication.Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):459-464.
Ordinal arithmetic and $\Sigma_{1}$ -elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
Functors and Ordinal Notations. IV: The Howard Ordinal and the Functor $\wedge$??Jacqueline Vauzeilles - 1985 - Journal of Symbolic Logic 50 (2):331-338.
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.
A notation system for ordinal using ψ‐functions on inaccessible mahlo numbers.Helmut Pfeiffer & H. Pfeiffer - 1992 - Mathematical Logic Quarterly 38 (1):431-456.
Review: Chen Chung Chang, Anne C. Morel, Some Cancellation Theorems for Ordinal Products of Relations; Chen Chung Chang, Cardinal and Ordinal Multiplication of Relation Types; C. C. Chang, Ordinal Factorization of Finite Relations. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (1):129-130.

Analytics

Added to PP
2013-10-27

Downloads
17 (#865,183)

6 months
4 (#778,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generic at.Vincenzo Dimonte - 2018 - Mathematical Logic Quarterly 64 (1-2):118-132.
LD-Algebras Beyond I0.Vincenzo Dimonte - 2019 - Notre Dame Journal of Formal Logic 60 (3):395-405.
The iterability hierarchy above I3. [REVIEW]Alessandro Andretta & Vincenzo Dimonte - 2019 - Archive for Mathematical Logic 58 (1-2):77-97.

Add more citations

References found in this work

Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
Reflection of elementary embedding axioms on the L[Vλ+1] hierarchy.Richard Laver - 2001 - Annals of Pure and Applied Logic 107 (1-3):227-238.
Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.

Add more references