Pages that link to "Item:Q1259589"

The following pages link to Intuitionistic propositional logic is polynomial-space complete (Q1259589):

Displaying 50 items.

• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322) (← links)
• An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
• Disjunction property and complexity of substructural logics (Q549720) (← links)
• Admissible rules in the implication-negation fragment of intuitionistic logic (Q638480) (← links)
• \(\lambda\)-definability of free algebras (Q803116) (← links)
• Complexity of admissible rules (Q868660) (← links)
• A lower bound for intuitionistic logic (Q876385) (← links)
• An informational view of classical logic (Q897935) (← links)
• Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
• Optimization techniques for propositional intuitionistic logic and their implementation (Q959821) (← links)
• The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete (Q1006641) (← links)
• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
• Satisfiability in many-valued sentential logic is NP-complete (Q1100196) (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
• On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619) (← links)
• Unification under a mixed prefix (Q1201348) (← links)
• Linearizing intuitionistic implication (Q1210141) (← links)
• The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
• Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete (Q1274981) (← links)
• The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
• The complexity of Horn fragments of linear logic (Q1337693) (← links)
• Complexity of some problems in positive and related calculi (Q1401362) (← links)
• On the polynomial-space completeness of intuitionistic propositional logic (Q1411664) (← links)
• Proof finding algorithms for implicational logics (Q1575928) (← links)
• Complexity of some language fragments of fuzzy logics (Q1699732) (← links)
• Tarski's theorem on intuitionistic logic, for polyhedra (Q1706265) (← links)
• Partial up an down logic (Q1903583) (← links)
• Rules with parameters in modal logic. II. (Q2004954) (← links)
• Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
• Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic (Q2119125) (← links)
• Proof theory for positive logic with weak negation (Q2193970) (← links)
• From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
• Pre-grammars and inhabitation for a subset of rank 2 intersection types (Q2333664) (← links)
• Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models (Q2351164) (← links)
• Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
• Typing in reflective combinatory logic (Q2498910) (← links)
• How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning (Q2520659) (← links)
• Proof compression and NP versus PSPACE (Q2631644) (← links)
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
• Stable Philosophical Systems and Radical Anti-realism (Q2908771) (← links)
• IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
• Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
• Plug and Play Negations (Q3305346) (← links)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding (Q3636908) (← links)
• Complexity of intuitionistic propositional logic and its fragments (Q3643316) (← links)
• A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications (Q3647294) (← links)
• Mereotopology in 2nd-Order and Modal Extensions of Intuitionistic Propositional Logic (Q3647305) (← links)
• Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
• Complexity of interpolation and related problems in positive calculi (Q4532622) (← links)