Propositional proof systems, the consistency of first order theories and the complexity of computations-Reference-Cited by-同舟云学术

Propositional proof systems, the consistency of first order theories and the complexity of computations

Published:1989-09 Issue:3 Volume:54 Page:1063-1079
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Krajíček Jan,Pudlák Pavel

Abstract

AbstractWe consider the problem about the length of proofs of the sentences saying that there is no proof of contradiction in S whose length is < n. We show the relation of this problem to some problems about propositional proof systems.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference16 articles.

1. Improved bounds to the length of proofs of finitistic consistency statements

2. On the scheme of induction for bounded arithmetic formulas;Paris;Annals of Pure and Applied Logic,1987

3. Dowd M. , Model-theoretic aspects of preprint, 1985.

4. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

Cited by 154 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Numeral completeness of weak theories of arithmetic;Journal of Logic and Computation;2023-12-12

2. Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution;Logical Methods in Computer Science;2023-04-14

3. New relations and separations of conjectures about incompleteness in the finite domain;The Journal of Symbolic Logic;2021-11-22

4. Information in propositional proofs and algorithmic proof search;The Journal of Symbolic Logic;2021-09-27

5. Substitution and Propositional Proof Complexity;Outstanding Contributions to Logic;2021-09-25