On the complexity of proof deskolemization
Journal of Symbolic Logic 77 (2):669-686 (2012)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
|
| Through your library | Configure |
Carlo Cellucci (1985). Proof Theory and Complexity. Synthese 62 (2):173 - 189.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Jan Krajíček & Pavel Pudlák (1989). Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. Journal of Symbolic Logic 54 (3):1063-1079.
Carlo Cellucci (2008). Why Proof? What is a Proof? In Giovanna Corsi & Rossella Lupacchini (eds.), Deduction, Computation, Experiment. Exploring the Effectiveness of Proof, pp. 1-27. Springer.
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
Lev Dmitrievich Beklemishev (1999). Provability, Complexity, Grammars. American Mathematical Society.
Jan Krajíček (2005). Structured Pigeonhole Principle, Search Problems and Hard Tautologies. Journal of Symbolic Logic 70 (2):619 - 630.
Yi-Zhuang Chen (2004). Edgar Morin's Paradigm of Complexity and Gödel's Incompleteness Theorem. World Futures 60 (5 & 6):421 – 431.
Claes Strannegård, Fredrik Engström, Abdul Rahim Nizamani & Lance Rips (2013). Reasoning About Truth in First-Order Logic. Journal of Logic, Language and Information 22 (1):115-137.
Paolo Gentilini (1999). Proof-Theoretic Modal Pa-Completeness I: A System-Sequent Metric. Studia Logica 63 (1):27-48.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-04-05Total downloads3 ( #201,730 of 548,984 )Recent downloads (6 months)1 ( #63,327 of 548,984 )How can I increase my downloads? |

