✦ LIBER ✦

The ∀∃-theory of the effectively closed Medvedev degrees is decidable

✍ Scribed by Joshua A. Cole; Takayuki Kihara

Book ID: 105842362
Publisher: Springer
Year: 2009
Tongue: English
Weight: 224 KB
Volume: 49
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-009-0150-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Closed Degrees of Difficulty o

A Note on Closed Degrees of Difficulty of the Medvedev Lattice

✍ Caterina Bianchini; Andrea Sorbi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB

We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are d

The first order theory of primal grammar

The first order theory of primal grammars is decidable

✍ Nicolas Peltier 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 630 KB

The theory of theαdegrees is undecidable

✍ C. T. Chong; T. A. Slaman 📂 Article 📅 2010 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 269 KB

The theory of({vec Z}C(2)^2)-lattices is

The theory of({vec Z}C(2)^2)-lattices is decidable

✍ Stefano Baratella; Carlo Toffalori 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 125 KB

Theory of the reflection effect in close

Theory of the reflection effect in close binary systems

✍ I. N. Minin 📂 Article 📅 1966 🏛 Springer 🌐 English ⚖ 351 KB

Endurance of the kindling effect is inde

Endurance of the kindling effect is independent of the degree of generalization

✍ Richard W. Homan; Jeffrey H. Goodman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 273 KB