Finite problems and the logic of the weak law of excluded middle
From MaRDI portal
Publication:2387846
DOI10.1007/s11006-005-0025-zzbMath1074.03005MaRDI QIDQ2387846
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
Kolmogorov complexity; intuitionistic logic; propositional calculus; deducibility; law of weak excluded middle; finite problems; sufficient solution set
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03B20: Subsystems of classical logic (including intuitionistic logic)
03B55: Intermediate logics
Related Items
Cites Work