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

DOI10.1007/s11006-005-0025-zzbMath1074.03005MaRDI QIDQ2387846

Alexei Chernov

Publication date: 5 September 2005

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11006-005-0025-z

zbMATH Keywords

Kolmogorov complexity; intuitionistic logic; propositional calculus; deducibility; law of weak excluded middle; finite problems; sufficient solution set

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

03B20: Subsystems of classical logic (including intuitionistic logic)

03B55: Intermediate logics

Related Items

Solving DC programs using the cutting angle method

Cites Work

• Complexity of sets obtained as values of propositional formulas
• Logical operations and Kolmogorov complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item