Simulating non-prenex cuts in quantified propositional calculus
暂无分享,去创建一个
[1] Jan Krajícek,et al. Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.
[2] Jan Krajícek,et al. Quantified propositional calculi and fragments of bounded arithmetic , 1990, Math. Log. Q..
[3] Tsuyoshi Morioka,et al. Logical approaches to the complexity of search problems: : proof complexity, quantified propositional calculus, and bounded arithmetic , 2005 .
[4] Stephen A. Cook,et al. Quantified propositional calculus and a second-order theory for NC1 , 2005, Arch. Math. Log..
[5] S. Cook,et al. Logical Foundations of Proof Complexity: INDEX , 2010 .
[6] Jan Krajícek,et al. On induction-free provability , 2005, Annals of Mathematics and Artificial Intelligence.