scientific article; zbMATH DE number 2072508

MaRDI QIDQ4467744zbMATH OpenFDO

Authors Mikhail Rybakov

Publication date 10 June 2004

zbMATH Keywords

basic propositional logiccomplexitydecision problemformal propositional logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables
• Decision problems of some intermediate logics and their fragments
• scientific article; zbMATH DE number 3995647
• scientific article; zbMATH DE number 2196586
• Complexity issues in Basic Logic

Cited in

(12)

• Completeness proofs for propositional logic with polynomial-time connectives
• Decidability and complexity analysis by basic paramodulation
• The complexity of primal logic with disjunction
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
• Relevance logic: problems open and closed
• Decision problems and recursiveness in formal logic systems
• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables
• scientific article; zbMATH DE number 2020142 (Why is no real title available?)
• The Exact Complexity of the First-Order Logic Definability Problem
• scientific article; zbMATH DE number 2196586 (Why is no real title available?)
• Complexity, decidability and completeness
• scientific article; zbMATH DE number 7594132 (Why is no real title available?)

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 Q4467744)