scientific article; zbMATH DE number 2209833

zbMATH1074.03007MaRDI QIDQ5692811FDOQ5692811

Authors Mikhail Rybakov

Publication date 28 September 2005

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Complexity of intuitionistic propositional logic and its fragments
• An embedding of the implicative fragment of classical logic into the implicative fragment of intuitionistic logic
• scientific article; zbMATH DE number 1975407
• Embedding first order predicate logic in fragments of intuitionistic logic
• scientific article; zbMATH DE number 1858065
• Computations in fragments of intuitionistic propositional logic
• The intuitionistic fragment of computability logic at the propositional level
• scientific article; zbMATH DE number 2090289
• On the complexity of fragments of modal logics
• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables

Cited in

(8)

• 2-cnfs and logical embeddings
• Embedding first order predicate logic in fragments of intuitionistic logic
• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables
• The model checking problem for propositional intuitionistic logic with one variable is \(\text{AC}^1\)-complete
• scientific article; zbMATH DE number 1975407 (Why is no real title available?)
• An embedding of the implicative fragment of classical logic into the implicative fragment of intuitionistic logic
• Complexity of intuitionistic propositional logic and its fragments
• An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692811)