Open Access
2008 Reflexive Intermediate First-Order Logics
Nathan C. Carter
Notre Dame J. Formal Logic 49(1): 75-95 (2008). DOI: 10.1215/00294527-2007-005

Abstract

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.

Citation

Download Citation

Nathan C. Carter. "Reflexive Intermediate First-Order Logics." Notre Dame J. Formal Logic 49 (1) 75 - 95, 2008. https://doi.org/10.1215/00294527-2007-005

Information

Published: 2008
First available in Project Euclid: 6 January 2008

zbMATH: 1191.03021
MathSciNet: MR2376852
Digital Object Identifier: 10.1215/00294527-2007-005

Subjects:
Primary: F03F50
Secondary: 03F55

Keywords: completeness , intermediate logics , reflexivity

Rights: Copyright © 2008 University of Notre Dame

Vol.49 • No. 1 • 2008
Back to Top