Pages that link to "Item:Q1304542"
From MaRDI portal
The following pages link to The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542):
Displaying 21 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- On lengths of proofs in non-classical logics (Q1006613) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Frege systems for extensible modal logics (Q2503409) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- (Q3760513) (← links)
- A note on the existence property for intuitionistic logic with function symbols (Q3824410) (← links)
- Disjunction and existence under implication in elementary intuitionistic formalisms (Q3851084) (← links)
- On the complexity of propositional quantification in intuitionistic logic (Q4358053) (← links)
- (Q4428299) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- The complexity of disjunction in intuitionistic logic (Q5108032) (← links)
- (Q5253806) (← links)
- Computer Science Logic (Q5292653) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- On the computational content of intuitionistic propositional proofs (Q5940143) (← links)
- Universal proof theory: feasible admissibility in intuitionistic modal logics (Q6652040) (← links)