Krivine's intuitionistic proof of classical completeness (for countable languages)

DOI10.1016/j.apal.2004.01.002zbMath1062.03058OpenAlexW2073185604MaRDI QIDQ1887656

Stefano Berardi, Silvio Valentini

Publication date: 22 November 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.01.002

zbMATH Keywords

ultrafilter theoremGödel's completeness theoremmaximal ideal theoremfirst-order classical logicintuitionistic completeness

Mathematics Subject Classification ID

Classical first-order logic (03B10) Intuitionistic mathematics (03F55) Basic properties of first-order languages and structures (03C07)

Related Items

Maximal elements with minimal logic, Kripke models for classical logic, Maximal ideals in countable rings, constructively

Cites Work

• Unnamed Item
• Undecidability and intuitionistic incompleteness
• Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
• Intuitionistic completeness for first order classical logic