Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 49, Number 1 (2008), 75-95.
Reflexive Intermediate First-Order Logics
It is known that the set of intermediate propositional logics that can prove their own completeness theorems is exactly those which prove every instance of the principle of testability, ¬ϕ ∨ ¬¬ϕ. Such logics are called reflexive. This paper classifies reflexive intermediate logics in the first-order case: a first-order logic is reflexive if and only if it proves every instance of the principle of double negation shift and the metatheory created from it proves every instance of the principle of testability.
Notre Dame J. Formal Logic, Volume 49, Number 1 (2008), 75-95.
First available in Project Euclid: 6 January 2008
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Carter, Nathan C. Reflexive Intermediate First-Order Logics. Notre Dame J. Formal Logic 49 (2008), no. 1, 75--95. doi:10.1215/00294527-2007-005. https://projecteuclid.org/euclid.ndjfl/1199649902