Δ1-definability

&
Annals of Pure and Applied Logic 89 (1):93-99 (1997)
  Copy   BIBTEX

Abstract

We isolate a condition on a class A of ordinals sufficient to Δ1-code it by a real in a class-generic extension of L. We then apply this condition to show that the class of ordinals of L-cofinality ω is Δ1 in a real of L-degree strictly below O#.

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(96)00023-1

Links

PhilArchive



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

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

Δ1-Definability.Sy D. Friedman & Boban Veličković - 1997 - Annals of Pure and Applied Logic 89 (1):93-99.
Review: Akiko Kino, On Definability of Ordinals in Logic with Infinitely Long Expressions; Akiko Kino, Correction to a Paper on Definability of Ordinals in Infinite Logic. [REVIEW]Carol Karp - 1970 - Journal of Symbolic Logic 35 (2):341-341.
A very absolute Pi-1-2 real singleton.René David - 1982 - Annals of Mathematical Logic 23 (2-3):101-120.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic.Miguel Couceiro, Lauri Hella & Jari Kivelä - 2008 - Logic Journal of the IGPL 16 (1):43-73.
On the Modal Definability of Simulability by Finite Transitive Models.David Fernández Duque - 2011 - Studia Logica 98 (3):347-373.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
On definability in multimodal logic: On definability in multimodal logic.Joseph Y. Halpern - 2009 - Review of Symbolic Logic 2 (3):451-468.
Definability in functional analysis.José Iovino - 1997 - Journal of Symbolic Logic 62 (2):493-505.
Definability in Functional Analysis.Jose Iovino - 1997 - Journal of Symbolic Logic 62 (2):493-505.
Relative randomness and real closed fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319-330.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.

Analytics

Added to PP
2017-02-19

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Proper Forcing.Saharon Shelah - 1985 - Journal of Symbolic Logic 50 (1):237-239.

Add more references