P. Pudl ak and J. Sgall, Algebraic models of computation and interpolation for algebraic systems, DIMACS Series in Discrete Math. and Theor. Comp. Sci. 39, (1998), pp. 279-295. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
No Feasible Monotone Interpolation for Simple.. - Noriko Arai Department (Correct)
....as interpolants: resolution, Cutting Planes are among those which enjoy such property. This fact is used to show that these propositional systems do not have polynomial size proofs for a sequence of tautologies expressing the positive and the negative instances of the k clique problem [4] 7] [8]. In this paper, we use the same tautologies to show the opposite result. GCNF permutation has polynomial size proofs for these tautologies, hence it does not enjoy feasible monotone interpolation. At the same time, our results show that Cutting Planes, Hilbert s Nullstellensatz and polynomial ....
....) is true (k01) Color(n) is false. Consequently, we have the following corollary. 5 Corollary 1 GCNF permutation does not admit feasible monotone interpolation. It was shown that Cutting Planes, polynomial calculus and Hilbert s Nullstellensatz do admit feasible monotone interpolation [7] [8]. Hence, they require exponential size proofs for k T est(n) under an adequate translation) Corollary 2 Any propositional calculus which admits feasible monotone interpolation does not p simulate GCNF permutation. More specifically, Cutting Planes, polynomial calculus and Hilbert s ....
P. Pudl'ak and J. Sgall, "Algebraic models of computation and interpolation for algebraic proof systems", submitted.
On the Computational Content of Intuitionistic Propositional .. - Buss, Pudlák (2000) (1 citation) (Correct)
....progress in proof complexity of propositional logic, which concerns various proof systems, suggest that the study of the complexity of intuitionistic propositional proofs may be a fruitful area. In particular for several classical calculi a so called feasible interpolation theorem was proved [5, 7, 9]. Such theorems enable one to extract a boolean circuit from a proof; the size of the circuit is polynomial in the size of the proof. Indeed, feasible interpolation theorem was proved for the intuitionistic sequent calculus in [8] The proof was based on the result of Buss and Mints [3] which ....
P. Pudl' ak and J. Sgall, Algebraic models of computation and interpolation for algebraic proof systems, DIMACS Series in Discrete Math. and Theoretical Comp. Sci. 39, (1998), pp. 279--295. 15
On the Computational Content of Intuitionistic - Propositional Proofs Samuel (Correct)
No context found.
P. Pudl ak and J. Sgall, Algebraic models of computation and interpolation for algebraic systems, DIMACS Series in Discrete Math. and Theor. Comp. Sci. 39, (1998), pp. 279-295.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC