On theorems of Gödel and Kreisel: Completeness and Markov's principle
From MaRDI portal
Publication:1333319
DOI10.1305/ndjfl/1040609297zbMath0801.03038OpenAlexW2070941135MaRDI QIDQ1333319
Publication date: 1 December 1994
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1040609297
Related Items (5)
Semantic completeness of first-order theories in constructive reverse mathematics ⋮ Non-classical metatheory for non-classical logics ⋮ Second-order logic and the power set ⋮ Kripke models for classical logic ⋮ Constructivism and Metamathematics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructivism in mathematics. An introduction. Volume II
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
- HILBERT'S PROGRAMME
- Markov's principle, isols and Dedekind finite sets
- On weak completeness of intuitionistic predicate logic
This page was built for publication: On theorems of Gödel and Kreisel: Completeness and Markov's principle