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

Author： Yu Liang   Ding De  

Publisher： Springer Publishing Company

ISSN： 1439-8516

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

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

Related content

Pairs without infimum in the recursively enumerable weak truth table degrees

By  

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

Cambridge University Press

Access to resources Recommend Favorite

The theory of the recursively enumerable weak truth-table degrees is undecidable

By  

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

Cambridge University Press

Access to resources Recommend Favorite

On the structures inside truth-table degrees

By  

The Journal of Symbolic Logic, Vol. 66, Iss. 2, 2001-06 ,pp. : 731-770

Cambridge University Press

Access to resources Recommend Favorite

Automorphisms of the truth-table degrees are fixed on a cone

By  

The Journal of Symbolic Logic, Vol. 74, Iss. 2, 2009-06 ,pp. : 679-688

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

By  

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

Cambridge University Press

Access to resources Recommend Favorite