The following pages link to (Q4215637):
Displaying 37 items.
- Proof complexity and textual cohesion (Q302177) (← links)
- Logical omniscience as infeasibility (Q392271) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Proof systems that take advice (Q553297) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- On the form of witness terms (Q982183) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Paraconsistent informational logic (Q1775866) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- Physics and proof theory (Q2249005) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Truth, disjunction, and induction (Q2312097) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study (Q2422312) (← links)
- Herbrand's theorem and term induction (Q2491080) (← links)
- Interpreting Weak König’s Lemma using the Arithmetized Completeness Theorem (Q2814420) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- A feasible interpolation for random resolution (Q2980967) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- A Measure of Logical Inference and Its Game Theoretical Applications (Q3094002) (← links)
- The Story of $$\gamma $$ γ (Q3305422) (← links)
- TRUTH AND FEASIBLE REDUCIBILITY (Q5107235) (← links)
- The small‐is‐very‐small principle (Q5108874) (← links)
- Truth definition for $\Delta _ 0$ formulas and PSPACE computations (Q5146427) (← links)
- A PARAMETRIC, RESOURCE-BOUNDED GENERALIZATION OF LÖB’S THEOREM, AND A ROBUST COOPERATION CRITERION FOR OPEN-SOURCE GAME THEORY (Q5207557) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
