✦ LIBER ✦

On predicate provability logics and binumerations of fragments of Peano arithmetic

✍ Scribed by Kurahashi, Taishi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The provability logics of recursively en

✍ Albert Visser 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 529 KB

Decidable and enumerable predicate logic

✍ Giorgie Dzhaparidze 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 958 KB

On arithmetical complexity of fragments

✍ Petr Hájek 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 133 KB

Subrecursive degrees and fragments of Pe

✍ Lars Kristiansen 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 243 KB

Reflection Principles in Fragments of Pe

✍ Hiroakira Ono 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 952 KB

Friedberg numbering in fragments of Pean

✍ Li, Wei 📂 Article 📅 2013 🏛 Association for Symbolic Logic 🌐 English ⚖ 285 KB