Abstract
In this paper we will study the properties of the least extension n(Λ) of a given intermediate logic Λ by a strong negation. It is shown that the mapping from Λ to n(Λ) is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n (Λ). This summarizes results that can be found already in [13,14] and [4]. Furthermore, we determine the structure of the lattice of extensions of n(LC).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Burris, Stanley and Sankappanavar, H. P. (1981): A Course in Universal Algebra. Number 78 in Graduate Texts in Mathematics. Springer.
Gelfond, Michael and Lifschitz, Vladimir (1988): The Stable Model Semantics for Logic Programs. In Proceedings of the 5th International Conference on Logic Programming, pp. 1070–1080. MIT–Press, Cambridge, Mass.
Gelfond, Michael and Lifschitz, Vladimir (1990): Logic Programs with Classical Negation. In Proceedings of the ICPL–90, pp. 579–597. MIT–Press, Cambridge, Mass.
Goranko, Valentin (1985): The Craig Interpolation Theorem for Propositional Logics with Strong Negation. Studia Logica 44: 291–317.
Herre, Heinrich and Pearce, David (1992): Disjunctive logic programming, constructivity and strong negation. In Logic in AI. Proceedings of the European Worshop JELIA 92, number 633 in Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin.
Maksimova, Larisa L. (1977): Craig's Theorem in superintionistic logics and amalgamable varieties of Pseudo–boolean algebras. Algebra and Logics 16: 427–455.
Nelson, David (1946): Constructible falsity. Journal of Symbolic Logic, 14: 16–26.
Pearce, David (1997): A new logical characterization of stable models and answer sets. In Dix, J., Pereira, L. M., and Przymusinski, T. (eds.): Nonmonotonic Extensions of Logic Programming. Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin.
Pearce, David and Wagner, Gerd (1990): Reasoning with negative information, I: Strong negation in logic programs. In Language, Knowledge and Intentionality (Acta Philosophica Fennica 49), pp. 405–439. Helsinki.
Pearce, David and Wagner, Gerd (1991): Logic programming with strong negation. In Schroeder-Heister, Peter (ed), Extensions of Logic Programming, number 475 in Lecture Notes in Artificial Intelligence, pp. 311–326. Springer-Verlag, Berlin.
Rasiowa, Helena (1958): N-lattices and constructive logic with strong negation. Fundamenta Mathematicae 46: 61–80.
Rautenberg, Wolfgang (1979): Klassische und nichtklassische Aussagenlogik. Vieweg Verlag, Braunschweig/Wiesbaden.
Sendlewski, Andrzej (1984): Some investigations of varieties of N-lattices. Studia Logica 43: 257–280.
Sendlewski, Andrzej (1990): Nelson algebras through Heyting ones. Studia Logica 49: 106–126.
Sendlewski, Andrzej (1995): Axiomatic extensions of the constructive logic with strong negation and the disjunction property. Studia Logica 55: 377–388.
Vakarelov, Dimiter (1977): Notes on N-lattices and constructive logic with strong negation. Studia Logica 36: 109–125.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kracht, M. On Extensions of Intermediate Logics by Strong Negation. Journal of Philosophical Logic 27, 49–73 (1998). https://doi.org/10.1023/A:1004222213212
Issue Date:
DOI: https://doi.org/10.1023/A:1004222213212