Low ce and low 2-ce degrees are not elementarily equivalent
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
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.
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.
On Downey's conjecture.Marat M. Arslanov, Iskander Sh Kalimullin & Steffen Lempp - 2010 - Journal of Symbolic Logic 75 (2):401-441.
Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.
On the t-degrees of partial functions.Paolo Casalegno - 1985 - Journal of Symbolic Logic 50 (3):580-588.
Existentially closed models via constructible sets: There are 2ℵ0 existentially closed pairwise non elementarily equivalent existentially closed ordered groups. [REVIEW]Anatole Khelif - 1996 - Journal of Symbolic Logic 61 (1):277 - 284.
Com 1 models of pouer to.L. -Elementarily Equivalent - 1981 - In M. Lerman, J. H. Schmerl & R. I. Soare (eds.), Logic Year 1979-80, the University of Connecticut, Usa. Springer Verlag. pp. 859--120.
The representation theories of elementarily equivalent rings.Mike Prest - 1998 - Journal of Symbolic Logic 63 (2):439-450.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
A transfer theorem for Henselian valued and ordered fields.Rafel Farré - 1993 - Journal of Symbolic Logic 58 (3):915 - 930.
The theory of the recursively enumerable weak truth-table degrees is undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.
Groups elementarily equivalent to a free nilpotent group of finite rank.Alexei G. Myasnikov & Mahmood Sohrabi - 2011 - Annals of Pure and Applied Logic 162 (11):916-933.
Rings of monoids elementarily equivalent to polynomial rings.Gérard Leloup - 1994 - Annals of Pure and Applied Logic 68 (2):173-180.
On a problem of Ishmukhametov.Chengling Fang, Guohua Wu & Mars Yamaleev - 2013 - Archive for Mathematical Logic 52 (7-8):733-741.
Analytics
Added to PP
2013-12-26
Downloads
12 (#805,948)
6 months
1 (#451,398)
2013-12-26
Downloads
12 (#805,948)
6 months
1 (#451,398)
Historical graph of downloads