Algorithmic Aspect of Σ-Definability over the Reals

&
Bulletin of Symbolic Logic 8 (1) (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,302

External links

  • This entry has no external links. Add one.
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

On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Jensen's Σ* theory and the combinatorial content of V = L.Sy D. Friedman - 1994 - Journal of Symbolic Logic 59 (3):1096 - 1104.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
Ω*1 as an initial segment of the c-degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956 - 976.
The stable core.Sy-David Friedman - 2012 - Bulletin of Symbolic Logic 18 (2):261-267.
Combinatorial properties of Hechler forcing.Jörg Brendle, Haim Judah & Saharon Shelah - 1992 - Annals of Pure and Applied Logic 58 (3):185-199.
Hechler reals.Grzegorz Łabędzki & Miroslav Repický - 1995 - Journal of Symbolic Logic 60 (2):444-458.
Mathias absoluteness and the Ramsey property.Lorenz Halbeisen & Haim Judah - 1996 - Journal of Symbolic Logic 61 (1):177-194.

Analytics

Added to PP
2014-03-24

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?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references