An application of constructive completeness
From MaRDI portal
Publication:4647571
DOI10.1007/3-540-61780-9_63zbMath1434.03098OpenAlexW104172771MaRDI QIDQ4647571
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
Nonstandard models of arithmetic (03H15) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
Intuitionistic completeness of first-order logic ⋮ A constructive investigation of satisfiability ⋮ Lindenbaum’s Lemma via Open Induction ⋮ Saturated models of universal theories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructivism in mathematics. An introduction. Volume II
- An intuitiomstic completeness theorem for intuitionistic predicate logic
- An intuitionistically plausible interpretation of intuitionistic logic
- Minimal models of Heyting arithmetic
- Pretopologies and completeness proofs
- On weak completeness of intuitionistic predicate logic
- Partially Ordered Sets
- Der Aussagenkalkül und die Topologie