Complexity of sets obtained as values of propositional formulas
From MaRDI portal
Publication:869787
DOI10.1023/B:MATN.0000015028.10892.68zbMath1114.03004MaRDI QIDQ869787
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
Kolmogorov complexity; intuitionistic logic; propositional calculus; deducibility; logical connectives; law of weak excluded middle
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03B05: Classical propositional logic
Related Items