scientific article
From MaRDI portal
Publication:3509064
zbMath1148.03005MaRDI QIDQ3509064
Publication date: 1 July 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (7)
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic ⋮ The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions ⋮ Proof complexity of substructural logics ⋮ The complexity of primal logic with disjunction
This page was built for publication:
