Krivine's intuitionistic proof of classical completeness (for countable languages)
DOI10.1016/J.APAL.2004.01.002zbMATH Open1062.03058OpenAlexW2073185604MaRDI QIDQ1887656FDOQ1887656
Authors: 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
Recommendations
- The Gödel completeness theorem for uncountable languages
- Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
- Intuitionistic completeness and classical logic
- scientific article; zbMATH DE number 856945
- An intuitionistic completeness theorem for classical predicate logic
- Typed Lambda Calculi and Applications
- scientific article; zbMATH DE number 4178794
- scientific article; zbMATH DE number 1169382
- Completeness and incompleteness for intuitionistic logic
- Theories of truth for countable languages which conform to classical logic
ultrafilter theorem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=G%EF%BF%BD%EF%BF%BDdel%27s+completeness+theorem&go=Go G��del's completeness theorem]maximal ideal theoremfirst-order classical logicintuitionistic completeness
Classical first-order logic (03B10) Basic properties of first-order languages and structures (03C07) Intuitionistic mathematics (03F55)
Cites Work
Cited In (4)
This page was built for publication: Krivine's intuitionistic proof of classical completeness (for countable languages)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887656)