Definability of r. e. sets in a class of recursion theoretic structures

Publisher： Cambridge University Press

E-ISSN： 1943-5886|48|3|662-669

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.48, Iss.3, 1983-09, pp. : 662-669

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

Universal recursion theoretic properties of r.e. preordered structures

By  

The Journal of Symbolic Logic, Vol. 50, Iss. 2, 1985-06 ,pp. : 397-406

Cambridge University Press

Access to resources Recommend Favorite

Definability in well quasi-ordered sets of structures

By  

The Journal of Symbolic Logic, Vol. 42, Iss. 2, 1977-06 ,pp. : 289-291

Cambridge University Press

Access to resources Recommend Favorite

Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets

By  

The Journal of Symbolic Logic, Vol. 58, Iss. 1, 1993-03 ,pp. : 81-98

Cambridge University Press

Access to resources Recommend Favorite

The ordertype of β-R.E. sets

By  

The Journal of Symbolic Logic, Vol. 55, Iss. 2, 1990-06 ,pp. : 573-576

Cambridge University Press

Access to resources Recommend Favorite

Minimal α-recursion theoretic degrees

By  

The Journal of Symbolic Logic, Vol. 38, Iss. 1, 1973-03 ,pp. : 18-28

Cambridge University Press

Access to resources Recommend Favorite