Complexity of sets obtained as values of propositional formulas

DOI10.1023/B:MATN.0000015028.10892.68zbMath1114.03004OpenAlexW2054594741MaRDI QIDQ869787

Alexei 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

Kolmogorov complexityintuitionistic logicpropositional calculusdeducibilitylogical connectiveslaw of weak excluded middle

Mathematics Subject Classification ID

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

Related Items (1)

Finite problems and the logic of the weak law of excluded middle

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