scientific article; zbMATH DE number 2209833

zbMATH Open1074.03007MaRDI QIDQ5692811FDOQ5692811

Mikhail Rybakov

Publication date: 28 September 2005

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• An embedding of the implicative fragment of classical logic into the implicative fragment of intuitionistic logic
• Title not available (Why is that?)
• 2-cnfs and logical embeddings

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Embedding first order predicate logic in fragments of intuitionistic logic 👍 👎
• Title not available (Why is that?) 👍 👎
• Computations in fragments of intuitionistic propositional logic 👍 👎
• The intuitionistic fragment of computability logic at the propositional level 👍 👎
• Title not available (Why is that?) 👍 👎
• On the complexity of fragments of modal logics 👍 👎
• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables 👍 👎

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)