Complexity of sets obtained as values of propositional formulas

DOI10.1023/B:MATN.0000015028.10892.68MaRDI QIDQ869787zbMATH OpenOpenAlexFDO

Authors Alexey Chernov

Publication date 9 March 2007

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:matn.0000015028.10892.68

zbMATH Keywords

deducibilityintuitionistic logicKolmogorov complexitylaw of weak excluded middlelogical connectivespropositional calculus

Mathematics Subject Classification ID

Classical propositional logic (03B05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Finite problems and the logic of the weak law of excluded middle
• On a complexity of the formula \((A\bigvee B) \Rightarrow C\)
• scientific article; zbMATH DE number 1948155
• Logical operations and Kolmogorov complexity
• scientific article; zbMATH DE number 6963530

Cited in

(4)

• On a complexity of the formula \((A\bigvee B) \Rightarrow C\)
• Finite problems and the logic of the weak law of excluded middle
• scientific article; zbMATH DE number 2174389 (Why is no real title available?)
• The logical complexity of geometric properties in the plane

This page was built for publication: Complexity of sets obtained as values of propositional formulas

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