Pairs without infimum in the recursively enumerable weak truth table degrees

E-ISSN： 1943-5886|51|1|117-129

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.51, Iss.1, 1986-03, pp. : 117-129

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 theory of the recursively enumerable weak truth-table degrees is undecidable

The Journal of Symbolic Logic, Vol. 57, Iss. 3, 1992-09 ,pp. : 864-874

Cambridge University Press

Access to resources Recommend Favorite

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

The Journal of Symbolic Logic, Vol. 61, Iss. 3, 1996-09 ,pp. : 880-905

Cambridge University Press

Access to resources Recommend Favorite

Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees

By Yu Liang Ding De

Acta Mathematica Sinica, Vol. 20, Iss. 1, 2004-01 ,pp. : 163-168

Springer Publishing Company

Access to resources Recommend Favorite

Minimal pairs and high recursively enumerable degrees

The Journal of Symbolic Logic, Vol. 39, Iss. 4, 1974-12 ,pp. : 655-660

Cambridge University Press

Access to resources Recommend Favorite

Definability in the Recursively Enumerable Degrees

Bulletin of Symbolic Logic, Vol. 2, Iss. 4, 1996-12 ,pp. : 392-404

Cambridge University Press

Access to resources Recommend Favorite