Pages that link to "Item:Q3472096"
From MaRDI portal
The following pages link to Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096):
Displaying 50 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Proof systems that take advice (Q553297) (← links)
- Speedup for natural problems and noncomputability (Q620964) (← links)
- On first-order theorem proving using generalized odd-superpositions II (Q674715) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Extension without cut (Q714731) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- The number of proof lines and the size of proofs in first order logic (Q1102280) (← links)
- Propositional consistency proofs (Q1177033) (← links)
- Refutational theorem proving for hierarchic first-order theories (Q1328182) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- Reduction of Hilbert-type proof systems to the if-then-else equational logic (Q1428985) (← links)
- On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
- Optimal heuristic algorithms for the image of an injective function (Q1946839) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675) (← links)
- Further oracles separating conjectures about incompleteness in the finite domain (Q2210516) (← links)
- An oracle separating conjectures about incompleteness in the finite domain (Q2290649) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- Propositional proof systems and fast consistency provers (Q2469433) (← links)
- Tautologies from pseudo-random generators (Q2736584) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- On optimal inverters (Q2925321) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- Consistency and Optimality (Q3091441) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Do there exist complete sets for promise classes? (Q3107337) (← links)
- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes (Q3392941) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988 (Q3478381) (← links)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- Nondeterministic Instance Complexity and Proof Systems with Advice (Q3618578) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS (Q3636159) (← links)
- Does Advice Help to Prove Propositional Tautologies? (Q3637158) (← links)
- Frege proof system and TNC° (Q4212930) (← links)
- (Q4268451) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
