Semantic completeness of first-order theories in constructive reverse mathematics
DOI10.1215/00294527-3470433zbMATH Open1403.03122OpenAlexW2188203153MaRDI QIDQ286708FDOQ286708
Publication date: 25 May 2016
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1455030207
Recommendations
- Semantical completeness of first-order predicate logic and the weak fan theorem
- Reverse mathematics and completeness theorems for intuitionistic logic
- Completeness theorems for first-order logic analysed in constructive type theory
- Completeness and incompleteness for intuitionistic logic
- The monotone completeness theorem in constructive reverse mathematics
Foundations of classical theories (including reverse mathematics) (03B30) Consistency and independence results (03E35) Metamathematics of constructive systems (03F50) Axiom of choice and related propositions (03E25)
Cites Work
- The axiom of choice
- Constructivism in mathematics. An introduction. Volume I
- On weak completeness of intuitionistic predicate logic
- Title not available (Why is that?)
- Reflexive intermediate first-order logics
- On theorems of Gödel and Kreisel: Completeness and Markov's principle
- Intuitionistic completeness and classical logic
- Reflexive intermediate propositional logics
- Title not available (Why is that?)
- Boolean Algebras and Distributive Lattices Treated Constructively
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completeness and incompleteness for intuitionistic logic
- Boolean algebras in a localic topos
Cited In (4)
This page was built for publication: Semantic completeness of first-order theories in constructive reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286708)