Ash, CJ, Stability of recursive structures in arithmetical degrees Ash, CJ, Categoric@ in hyperarithmetical degrees

, , , , , &
Annals of Pure and Applied Logic 40:307-310 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
ASH, CJ, Stability of recursive structures in arithmetical degrees BLASS, A. and GUREVICH, Y., Henkin quantifiers and complete problems BUCHHOLZ, W., A new system of proof-theoretic ordinal functions. [REVIEW]H. Friedman & Rc Flagg - 1986 - Annals of Pure and Applied Logic 32 (C):299.
ASH, CJ, Categoricity in hyperarithmetical degrees BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees.J. Steprans & S. Shelah - 1987 - Annals of Pure and Applied Logic 34:311.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.
ASH, CJ, Categoricity in hyperarithmetical degrees (1) BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap (3) COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees (1). [REVIEW]Rl Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):311.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
On the very idea of degrees of truth.Timothy Cleveland - 1997 - Australasian Journal of Philosophy 75 (2):218 – 221.
Minimal degrees recursive in 1-generic degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.
On Downey's conjecture.Marat M. Arslanov, Iskander Sh Kalimullin & Steffen Lempp - 2010 - Journal of Symbolic Logic 75 (2):401-441.
Elementary Differences between the (2p)-C. E. and the (2p + 1)-C. E. Enumeration Degrees.I. Sh Kalimullin - 2007 - Journal of Symbolic Logic 72 (1):277 - 284.

Analytics

Added to PP
2014-04-04

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