Abstract
In this paper we deal with infinitary universal Horn logic both with and without equality. First, we obtain a relative Lyndon-style interpolation theorem. Using this result, we prove a non-standard preservation theorem which contains, as a particular case, a Lyndon-style theorem on surjective homomorphisms in its Makkai-style formulation. Another consequence of the preservation theorem is a theorem on bimorphisms, which, in particular, provides a tool for immediate obtaining characterizations of infinitary universal Horn classes without equality from those with equality. From the theorem on surjective homomorphisms we also derive a non-standard Beth-style preservation theorem that yields a non-standard Beth-style definability theorem, according to which implicit definability of a relation symbol in an infinitary universal Horn theory implies its explicit definability by a conjunction of atomic formulas. We also apply our theorem on surjective homomorphisms, theorem on bimorphisms and definability theorem to algebraic logic for general propositional logic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K.R., van Emden, M.H.: Contributions to the theory of logic programming. J. Association for Computing Machinery 29, 841–862 (1982)
Asenjo, F.G., Tamburino, J.: Logic of antinomies. Notre Dame J. Formal Logic 16, 272–278 (1975).
Banaschewski, B., Herrlich, H.: Subcategories defined by implications. Houston J. Math. 2, 105–130 (1976)
Birkhoff, G.: On the structure of abstract algebras. Proceedings of the Cambridge Philosophy Society 31, 433–454 (1935)
Bloom, S.L.: Some theorems on structural consequence relations. Studia Logica 34, 1–9 (1975)
Budkin, A.I., Gorbunov, V.A.: Implicative classes of algebras. Algebra and Logic 12, 139–140 (1973)
Chudnovskii, G.V.: Some results in the theory of infinitely long expressions. Soviet Mathematics Doklady 9, 556–559 (1968)
Dummett, M.: A propositional calculus with denumerable matrix. J. Symbolic Logic 24, 97–106 (1959)
van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. Association for Computing Machinery 23, 733–742 (1976)
Gödel, K.: Zum intuitionistischen Aussagenkalkül. Anz. Akad. Wiss. Wien 69, 65–66 (1932)
Grätzer, G.: General lattice theory. Akademie-Verlag, Berlin, 1978
Kleene, S.C.: Introduction to metamathematics. D. Van Nostrand Company, New York, 1952
Łukasiewicz, J.: O logice trójwartościowej. Ruch Filozoficzny 5, 170–171 (1920)
Makkai, M.: On the model theory of denumerably long formulas with finite strings of quantifiers. J. Symbolic Logic 34, 437–459 (1969)
Mal'cev, A.I.: Quasiprimitive classes of abstract algebras (in Russian). Doklady Akademii Nauk SSSR 108, 187–189 (1956)
Mal'cev, A.I.: Algebraic systems. Springer-Verlag, Berlin, 1973
Priest, G.: The logic of paradox. J. Philosophical Logic 8, 219–241 (1979)
Pynko, A.P.: On Priest's logic of paradox. J. Appl. Non-Classical Logics 5, 219–225 (1995)
Pynko, A.P.: Definitional equivalence and algebraizability of generalized logical systems. Annals of Pure and Applied Logic 98, 1–68 (1999)
Pynko, A.P.: Implication systems for many-dimensional logics. Reports on Mathematical Logic 33, 11–28 (1999)
Pynko, A.P.: Functional completeness and axiomatizability within Belnap's four-valued logic and its expansions. J. Appl. Non-Classical Logics 9, 61–105 (1999)
Pynko, A.P.: Sequential calculi for many-valued logics with equality determinant. Bulletin of the Section of Logic 33, 23–32 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pynko, A. A relative interpolation theorem for infinitary universal Horn logic and its applications. Arch. Math. Logic 45, 267–305 (2006). https://doi.org/10.1007/s00153-005-0302-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-005-0302-2