Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae

DOI10.2307/2964291MaRDI QIDQ3259069zbMATH OpenOpenAlexFDO

Authors Georg Kreisel

Publication date 1959

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2964291

zbMATH Keywords

philosophy and foundations of mathematics

Cites work

• Intuitionism. An introduction
• Proofs of non-deducibility in intuitionistic functional calculus

Cited in

(10)

• On theorems of Gödel and Kreisel: Completeness and Markov's principle
• Jean van Heijenoort's contributions to proof theory and its history
• Meaning-preserving translations of non-classical logics into classical logic: between pluralism and monism
• Reflexive intermediate propositional logics
• The prehistory of the subsystems of second-order arithmetic
• On the Mints hierarchy in first-order intuitionistic logic
• Semantical analysis of the logic of bunched implications
• Why classical logic is privileged: justification of logics based on translatability
• The completeness theorem? So what!
• Truth, proofs and functions

This page was built for publication: Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae

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