Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees
Fischer, Paul
J. Symbolic Logic, Tome 51 (1986) no. 1, p. 117-129 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1986-03-14
Classification:  
@article{1183742032,
     author = {Fischer, Paul},
     title = {Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees},
     journal = {J. Symbolic Logic},
     volume = {51},
     number = {1},
     year = {1986},
     pages = { 117-129},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742032}
}

Fischer, Paul. Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. J. Symbolic Logic, Tome 51 (1986) no. 1, pp.  117-129. http://gdmltest.u-ga.fr/item/1183742032/