Negative solution of the decision problem for sentences true in every subalgebra of 〈N, +〉

Publisher： Cambridge University Press

E-ISSN： 1943-5886|36|4|607-609

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.36, Iss.4, 1971-12, pp. : 607-609

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

The decision problem for some classes of sentences without quantifiers

By  

The Journal of Symbolic Logic, Vol. 8, Iss. 3, 1943-09 ,pp. : 61-76

Cambridge University Press

Access to resources Recommend Favorite

The degree of the set of sentences of predicate provability logic that are true under every interpretation1

By  

The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. : 165-171

Cambridge University Press

Access to resources Recommend Favorite

On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model1

By  

The Journal of Symbolic Logic, Vol. 40, Iss. 2, 1975-06 ,pp. : 186-196

Cambridge University Press

Access to resources Recommend Favorite

Sentences true in all constructive models

By  

The Journal of Symbolic Logic, Vol. 25, Iss. 1, 1960-03 ,pp. : 39-53

Cambridge University Press

Access to resources Recommend Favorite

The Frattini Subalgebra of n-Lie Algebras

By Bai Rui   Chen Liang   Meng Dao  

Acta Mathematica Sinica, Vol. 23, Iss. 5, 2007-05 ,pp. : 847-856

Springer Publishing Company

Access to resources Recommend Favorite