Pages that link to "Item:Q3643316"

The following pages link to Complexity of intuitionistic propositional logic and its fragments (Q3643316):

Displaying 18 items.

• Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
• Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
• Computations in fragments of intuitionistic propositional logic (Q1181713) (← links)
• Complexity of some language fragments of fuzzy logics (Q1699732) (← links)
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
• Proof theory for positive logic with weak negation (Q2193970) (← links)
• Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
• Comparison of several proof systems of intuitionistic propositional logic (Q2826389) (← links)
• Intuitionistic implication without disjunction (Q2893316) (← links)
• The model checking problem for propositional intuitionistic logic with one variable is AC 1 -complete (Q3113702) (← links)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
• (Q3760514) (← links)
• On the complexity of propositional quantification in intuitionistic logic (Q4358053) (← links)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
• The complexity of disjunction in intuitionistic logic (Q5108032) (← links)
• (Q5692811) (← links)
• Complexity of finite-variable fragments of products with non-transitive modal logics (Q5866476) (← links)