Combinatorics of first order structures and propositional proof systems

DOI10.1007/S00153-003-0186-YMaRDI QIDQ701740zbMATHOpenAlexFDO

Authors Jan Krajíček

Publication date 16 December 2004

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-003-0186-y

zbMATH Keywords

complexity of proofsmodel-theoretic method

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Basic properties of first-order languages and structures (03C07) Complexity of proofs (03F20)

Recommendations

• A finite-model-theoretic view on propositional proof complexity
• Publication:5111195
• The Complexity of Propositional Proofs
• Publication:4399249
• Propositional proof systems, the consistency of first order theories and the complexity of computations

Cited in

(12)

• Partially definable forcing and bounded arithmetic
• scientific article; zbMATH DE number 1907992 (Why is no real title available?)
• The Andrews-Curtis conjecture, term rewriting and first-order proofs
• scientific article; zbMATH DE number 1688382 (Why is no real title available?)
• Lower bounds for DNF-refutations of a relativized weak pigeonhole principle
• A logical approach to asymptotic combinatorics I. First order properties
• A note on propositional proof complexity of some Ramsey-type statements
• The treewidth of proofs
• Relativization makes contradictions harder for resolution
• Tight size-degree bounds for sums-of-squares proofs
• Expansions of pseudoinfinite structures and circuit and proof complexity
• A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic

This page was built for publication: Combinatorics of first order structures and propositional proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701740)