An application of constructive completeness

DOI10.1007/3-540-61780-9_63zbMATH Open1434.03098OpenAlexW104172771MaRDI QIDQ4647571FDOQ4647571

Authors Thierry Coquand, Jan Smith

Publication date 15 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61780-9_63

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Nonstandard models of arithmetic (03H15) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90)

Cites work

• scientific article; zbMATH DE number 4152376 (Why is no real title available?)
• scientific article; zbMATH DE number 3552491 (Why is no real title available?)
• scientific article; zbMATH DE number 3557754 (Why is no real title available?)
• scientific article; zbMATH DE number 575914 (Why is no real title available?)
• An intuitiomstic completeness theorem for intuitionistic predicate logic
• An intuitionistically plausible interpretation of intuitionistic logic
• Constructivism in mathematics. An introduction. Volume II
• Der Aussagenkalkül und die Topologie
• Minimal models of Heyting arithmetic
• On weak completeness of intuitionistic predicate logic
• Partially Ordered Sets
• Pretopologies and completeness proofs

Cited in

(4)

• Intuitionistic completeness of first-order logic
• Lindenbaum's lemma via open induction
• Saturated models of universal theories
• A constructive investigation of satisfiability

This page was built for publication: An application of constructive completeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647571)