A remark concerning decidability of complete theories1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|15|4|277-279

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.15, Iss.4, 1950-12, pp. : 277-279

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

Decidability of some intuitionistic predicate theories

By  

The Journal of Symbolic Logic, Vol. 37, Iss. 3, 1972-09 ,pp. : 579-587

Cambridge University Press

Access to resources Recommend Favorite

Decidability and undecidability of theories with a predicate for the primes

By  

The Journal of Symbolic Logic, Vol. 58, Iss. 2, 1993-06 ,pp. : 672-687

Cambridge University Press

Access to resources Recommend Favorite

Some remarks concerning theories with recursively enumerable complements 1

By  

The Journal of Symbolic Logic, Vol. 28, Iss. 1, 1963-03 ,pp. : 72-74

Cambridge University Press

Access to resources Recommend Favorite

DECIDABILITY FOR THEORIES OF MODULES OVER VALUATION DOMAINS

By  

The Journal of Symbolic Logic, Vol. 80, Iss. 2, 2015-04 ,pp. : 684-711

Cambridge University Press

Access to resources Recommend Favorite

Complete theories with countably many rigid nonisomorphic models1

By  

The Journal of Symbolic Logic, Vol. 40, Iss. 3, 1975-09 ,pp. : 389-392

Cambridge University Press

Access to resources Recommend Favorite