✦ LIBER ✦

Computational complexity of logical theories of one successor and another unary function

✍ Scribed by Pascal Michel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Springer Monographs in Mathematics] Log

✍ Pudlák, Pavel 📂 Article 📅 2013 🏛 Springer International Publishing ⚖ 843 KB

Computational complexity of interacting

✍ Schuch, Norbert; Verstraete, Frank 📂 Article 📅 2009 🏛 Nature Publishing Group 🌐 English ⚖ 946 KB

On the Logic of Theory Change: Partial M

✍ Carlos E. Alchourrón, Peter Gärdenfors and David Makinson 📂 Article 📅 1985 🏛 Association for Symbolic Logic 🌐 English ⚖ 439 KB

[Universitext] A Course on Mathematical

✍ Srivastava, Shashi Mohan 📂 Article 📅 2012 🏛 Springer New York ⚖ 220 KB

Logic, Foundations of Mathematics, and C

✍ Butts, Robert E.; Hintikka, Jaakko 📂 Article 📅 1977 🏛 Springer Netherlands ⚖ 705 KB

A note on “axioms” for computational com

✍ Paul D. Young 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 480 KB