The Undecidability of k-Provability (1989)

by Samuel R. Buss
Venue:Annals of Pure and Applied Logic
Citations:27 - 0 self

Active Bibliography

1 Term Induction – Georg Christian Moser - 2001
17 ON THE NUMBER OF STEPS IN PROOFS – Jan Krajícek - 1989
I of M A T H E M – unknown authors - 2006
Upper Bound on the Height of Terms in Proofs with Cuts – Boris Konev - 1998
4 Generalizing Theorems in Real Closed Fields – Matthias Baaz, Richard Zach - 1995
7 On Gödel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics – Samuel R. Buss
Linear lower bounds and simulations in Frege systems with substitutions – Maria Luisa Bonet, Nicola Galesi - 1997
5 The Craig Interpolation Theorem for Schematic Systems – A. Carbone - 1996
Decidability and Undecidability Results for Propositional Schemata – Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
3 Does Reductive Proof Theory Have A Viable Rationale? – Solomon Feferman - 2000
66 Completion of Rewrite Systems with Membership Constraints Part II: Constraint Solving – Hubert Comon - 1992
6 Decidability of Bounded Second Order Unification – Manfred Schmidt-Schauß - 1999
2 The Number of Proof Lines and the Size of Proofs. in First Order Logic – Jan Krajíèek, Pavel Pudlák
13 Beta-Reduction As Unification – A.J. Kfoury - 1996
WARSZAWA 199* BETA-REDUCTION AS UNIFICATION DEDICATED TO THE MEMORY OF PROFESSOR HELENA RASIOWA – A. J. Kfoury
8 The Complexity of Resource-Bounded First-Order Classical Logic – Jean Goubault - 1994
3 Nearly-exponential size lower bounds for symbolic quantifier elimination algorithms and OBDD-based proofs of unsatisfiability – Nathan Segerlind - 2007
7 Decidability of Bounded Higher-Order Unification – Manfred Schmidt-Schauß, Klaus U. Schulz - 2002
1 A Higher-Order Extension of Constraint Programming in Discourse Analysis – Tim Fernando - 1993