A characterization of Σ 1 1 -reflecting ordinals

Annals of Pure and Applied Logic 172 (10):103009 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2021.103009

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

Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
A model of the generic Vopěnka principle in which the ordinals are not Mahlo.Victoria Gitman & Joel David Hamkins - 2019 - Archive for Mathematical Logic 58 (1-2):245-265.
Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Extensions of the constructive ordinals.Wayne Richter - 1965 - Journal of Symbolic Logic 30 (2):193-211.
An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy.Andreas Weiermann - 1993 - Mathematical Logic Quarterly 39 (1):367-383.
Operating on the universe.Narciso Garcia - 1988 - Archive for Mathematical Logic 27 (1):61-68.
Full classes and ordinals.Sherman K. Stein - 1960 - Journal of Symbolic Logic 25 (3):217-219.
Characterizing strong compactness via strongness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (4):375.
The universe constructed from a sequence of ordinals.W. Hugh Woodin - 1996 - Archive for Mathematical Logic 35 (5-6):371-383.
Trees and Ehrenfeucht–Fraı̈ssé games.Jouko Väänänen & Stevo Todorcevic - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.

Analytics

Added to PP
2021-07-08

Downloads
13 (#1,032,575)

6 months
3 (#965,065)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.
Weak axioms of determinacy and subsystems of analysis I: δ20 games.Kazuyuki Tanaka - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (6):481-491.
Shortening clopen games.Juan P. Aguilera - 2021 - Journal of Symbolic Logic 86 (4):1541-1554.

View all 8 references / Add more references