✦ LIBER ✦

Hypersimplicity and semicomputability in the weak truth table degrees

✍ Scribed by George Barmpalias

Publisher: Springer
Year: 2005
Tongue: English
Weight: 236 KB
Volume: 44
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-005-0288-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infimum Properties Differ in the Weak Tr

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

✍ Liang Yu; De Cheng Ding 📂 Article 📅 2004 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 131 KB

Interpreting N in the computably enumera

Interpreting N in the computably enumerable weak truth table degrees

✍ André Nies 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 129 KB

We give a ÿrst-order coding without parameters of a copy of (N; +; ×) in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter deÿnable subsets.

Cupping and noncapping in the r.e. weak

Cupping and noncapping in the r.e. weak truth table and turing degrees

✍ Ambos-Spies, Klaus 📂 Article 📅 1985 🏛 Springer-Verlag ⚖ 930 KB

The rebinder effect in corrosive and wea

The rebinder effect in corrosive and weak surface active media : G. V. Karpenko, E. M. Gutman and I. I. Vasilenko, Soviet Mater. Sci., 3 (5) (1967) 382–388; 6 figs., 2 tables, 13 refs

📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 214 KB