Pages that link to "Item:Q1259589"
From MaRDI portal
The following pages link to Intuitionistic propositional logic is polynomial-space complete (Q1259589):
Displaying 16 items.
- Proof-search in intuitionistic logic based on constraint satisfaction (Q4645245) (← links)
- Studying provability in implicational intuitionistic logic (Q4916206) (← links)
- The emptiness problem for intersection types (Q4934035) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- A unifying framework for type inhabitation (Q4993331) (← links)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV (Q5009678) (← links)
- (Q5013887) (← links)
- (Q5020970) (← links)
- The complexity of principal inhabitation (Q5111311) (← links)
- Proof Compression and NP Versus PSPACE II (Q5147748) (← links)
- Some pitfalls of LK-to-LJ translations and how to avoid them (Q5234695) (← links)
- Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) (Q5277900) (← links)
- Sequent Calculus for Intuitionistic Epistemic Logic IEL (Q5283428) (← links)
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic (Q5957858) (← links)
- (Q6060673) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)