Undecidability of L(F∞) and other lattices of r.e. substructures

Annals of Pure and Applied Logic 32:17-26 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(86)90041-2

Other Versions

No versions found

Links

PhilArchive



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

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

Correction to “undecidability of L(F∞) and other lattices of r.e. substructures”.Rod Downey - 1990 - Annals of Pure and Applied Logic 48 (3):299-301.
Downey, R., f, iiForte, G. and Nies, A., Addendum to.R. Jin, I. Kalantari, L. Welch, B. Khoussainov, R. A. Shore, A. P. Pynko, P. Scowcroft, S. Shelah, J. Zapletal & J. B. Wells - 1999 - Annals of Pure and Applied Logic 98:299.
Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.
Downey, R., Gasarch, W. and Moses, M., The structure.S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):287.
Downey, R., Fiiredi, Z., Jockusch Jr., CG and Ruhel, LA.W. I. Gasarch, A. C. Y. Lee, M. Groszek, T. Hummel, V. S. Harizanov, H. Ishihara, B. Khoussainov, A. Nerode, I. Kalantari & L. Welch - 1998 - Annals of Pure and Applied Logic 93:263.
Lattice nonembeddings and intervals of the recursively enumerable degrees.Peter Cholak & Rod Downey - 1993 - Annals of Pure and Applied Logic 61 (3):195-221.
An undecidability theorem for lattices over group rings.Carlo Toffalori - 1997 - Annals of Pure and Applied Logic 88 (2-3):241-262.
CUMMINGS, J., Possible behaviours for the Mitchell ordering DOUGHERTY, R., Critical points in an algebra of elementary embeddings DOWNEY, R. and STOB, M., Splitting theorems in recursion theory. [REVIEW]J. Vaananen - 1993 - Annals of Pure and Applied Logic 65:307.
Samuel R. Buss. The undecidability of k-provability. Annals of pure and applied logic, vol. 53 , pp. 75–102.Alessandra Carbone - 1997 - Journal of Symbolic Logic 62 (4):1480-1481.
ABRAHAM, U. and SHELAH, S., A AZ well-order of the reals and incompactness of L (Q”“) BUSS, SR, Intuitionistic validity in T-normal Kripke structures CAICEDO, X., Compactness and normality in abstract logics CENZER, D., DOWNEY, R., JOCKUSCH, C. and SHORE. [REVIEW]L. Li, L. I. H. & L. I. U. Y. - 1993 - Annals of Pure and Applied Logic 59:287.

Analytics

Added to PP
2014-01-16

Downloads
49 (#468,991)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Quasimaximality and principal filters isomorphism between.Rumen Dimitrov - 2004 - Archive for Mathematical Logic 43 (3):415-424.
Degree invariance in the Π10classes.Rebecca Weber - 2011 - Journal of Symbolic Logic 76 (4):1184-1210.

View all 6 citations / Add more citations

References found in this work

Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.
A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore, Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
First-order theories of abstract dependence relations.John T. Baldwin - 1984 - Annals of Pure and Applied Logic 26 (3):215-243.
On a question of A. Retzlaff.Rod Downey - 1983 - Mathematical Logic Quarterly 29 (6):379-384.

View all 11 references / Add more references