The Complexity of intrinsically r.e. subsets of existentially decidable models

Publisher： Cambridge University Press

E-ISSN： 1943-5886|55|3|1213-1232

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.55, Iss.3, 1990-09, pp. : 1213-1232

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Indiscernibles and decidable models

By  

The Journal of Symbolic Logic, Vol. 48, Iss. 1, 1983-03 ,pp. : 21-32

Cambridge University Press

Access to resources Recommend Favorite

A complete, decidable theory with two decidable models1

By  

The Journal of Symbolic Logic, Vol. 44, Iss. 3, 1979-09 ,pp. : 307-312

Cambridge University Press

Access to resources Recommend Favorite

DECIDABLE MODELS OF ω-STABLE THEORIES

By  

The Journal of Symbolic Logic, Vol. 79, Iss. 1, 2014-04 ,pp. : 186-192

Cambridge University Press

Access to resources Recommend Favorite

Existentially closed models of the theory of artinian local rings

By  

The Journal of Symbolic Logic, Vol. 64, Iss. 2, 1999-06 ,pp. : 825-845

Cambridge University Press

Access to resources Recommend Favorite

Existentially closed models via constructible sets: There are 2 ℵ0 existentially closed pairwise non elementarily equivalent existentially closed ordered groups

By  

The Journal of Symbolic Logic, Vol. 61, Iss. 1, 1996-03 ,pp. : 277-284

Cambridge University Press

Access to resources Recommend Favorite