Complexity of sets obtained as values of propositional formulas

DOI10.1023/B:MATN.0000015028.10892.68zbMATH Open1114.03004OpenAlexW2054594741MaRDI QIDQ869787FDOQ869787

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

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

zbMATH Keywords

intuitionistic logicKolmogorov complexitydeducibilitylogical connectivespropositional calculuslaw of weak excluded middle

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Finite problems and the logic of the weak law of excluded middle
• 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)