✦ LIBER ✦

Coding true arithmetic in the Medvedev and Muchnik degrees

✍ Scribed by Shafer, Paul

Book ID: 124069242
Publisher: Association for Symbolic Logic
Year: 2011
Tongue: English
Weight: 240 KB
Volume: 76
Category: Article
ISSN: 0022-4812
DOI: 10.2178/jsl/1294171000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coding true arithmetic in the Medvedev d

Coding true arithmetic in the Medvedev degrees of classes

✍ Paul Shafer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Interpreting true arithmetic in the -enu

Interpreting true arithmetic in the -enumeration degrees

✍ Kent, Thomas F. 📂 Article 📅 2010 🏛 Association for Symbolic Logic 🌐 English ⚖ 314 KB

Interpreting true arithmetic in the loca

Interpreting true arithmetic in the local structure of the enumeration degrees

✍ Ganchev, Hristo; Soskova, Mariya 📂 Article 📅 2012 🏛 Association for Symbolic Logic 🌐 English ⚖ 144 KB

The definable criterion for definability

The definable criterion for definability in Presburger arithmetic and its applications

✍ An.A. Muchnik 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 131 KB

In Section 1 of present paper we construct a formula 'n(A) of Presburger arithmetic (integers with addition and order) with additional n-ary predicate variable A. This formula is true if and only if predicate A is deÿnable in Presburger arithmetic (Theorem 2). This formula is used to prove the foll

Derivations and generating degrees in th

Derivations and generating degrees in the ring of arithmetical functions

✍ Alexandru Zaharescu; Mohammad Zaki 📂 Article 📅 2007 🏛 Indian Academy of Sciences 🌐 English ⚖ 126 KB

Minimizing excess code length and VLSI c

Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding

✍ Gennady Feygin; P.Glenn Gulak; Paul Chow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 853 KB