Weihrauch degrees, omniscience principles and weak computability

Publisher： Cambridge University Press

E-ISSN： 1943-5886|76|1|143-176

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.76, Iss.1, 2011-03, pp. : 143-176

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

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

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

Approximate Euler characteristic, dimension, and weak pigeonhole principles

By  

The Journal of Symbolic Logic, Vol. 69, Iss. 1, 2004-03 ,pp. : 201-214

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