Some highly undecidable lattices

, , &
Annals of Pure and Applied Logic 46 (1):41-63 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(90)90077-f

Links

PhilArchive



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

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

The theory of {vec Z}C(2)^2-lattices is decidable.Stefano Baratella & Carlo Toffalori - 1998 - Archive for Mathematical Logic 37 (2):91-104.
The decision problem for {vec Z}C(p^3)-lattices with p prime.Carlo Toffalori - 1998 - Archive for Mathematical Logic 37 (2):127-142.
Decision problem for separated distributive lattices.Yuri Gurevich - 1983 - Journal of Symbolic Logic 48 (1):193-196.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Two identities for lattices, distributive lattices and modular lattices with a constant.Saburo Tamura - 1975 - Notre Dame Journal of Formal Logic 16 (1):137-140.
Some investigations of varieties of N -lattices-lattices.Andrzej Sendlewski - 1984 - Studia Logica 43 (3):257-280.
On the representation of n4-lattices.Sergei P. Odintsov - 2004 - Studia Logica 76 (3):385 - 405.
Representation of finite demi-p-lattices by means of posets.Hernando Gaitan - 1996 - Studia Logica 56 (1-2):97 - 110.
Prime Filters, Normality and Irreducibility in Lattices.Gabriela Hauser-Bordalo - 2011 - Studia Logica 98 (1-2):5-7.
Information flow between weakly interacting lattices of coupled maps.Harald Atmanspacher - manuscript
Some Investigations of Varieties of N-Lattices.Andrzej Sendlewski - 1984 - Studia Logica 43 (3):257 - 280.
Free modal lattices via Priestley duality.Claudia B. Wegener - 2002 - Studia Logica 70 (3):339 - 352.
Finite combinatory processes. Formulation I.Alonzo Church - 1965 - In Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication. pp. 289.

Analytics

Added to PP
2014-01-16

Downloads
23 (#626,176)

6 months
1 (#1,346,405)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Elementary equivalence of infinite-dimensional classical groups.Vladimir Tolstykh - 2000 - Annals of Pure and Applied Logic 105 (1-3):103-156.

Add more citations

References found in this work

Intersections of algebraically closed fields.C. J. Ash & John W. Rosenthal - 1986 - Annals of Pure and Applied Logic 30 (2):103-119.
Some theories associated with algebraically closed fields.Chris Ash & John Rosenthal - 1980 - Journal of Symbolic Logic 45 (2):359-362.

Add more references