Pages that link to "Item:Q701740"
From MaRDI portal
The following pages link to Combinatorics of first order structures and propositional proof systems (Q701740):
Displaying 11 items.
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic (Q266237) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- A logical approach to asymptotic combinatorics I. First order properties (Q1103939) (← links)
- The Andrews-Curtis conjecture, term rewriting and first-order proofs (Q1662269) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- (Q2762523) (← links)
- (Q4805940) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)