Abstract
This paper introduces an algebraic semantics for hybrid logic with binders \({\mathcal{H}(\downarrow,@)}\). It is known that this formalism is a modal counterpart of the bounded fragment of the first-order logic, studied by Feferman in the 1960’s. The algebraization process leads to an interesting class of boolean algebras with operators, called substitution-satisfaction algebras. We provide a representation theorem for these algebras and thus provide an algebraic proof of completeness of hybrid logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Areces, C., Blackburn, P., Marx, M.: Hybrid logic is the bounded fragment of first order logic. In: de Queiroz, R., Carnielli, W. (eds.) Proceedings of 6th Workshop on Logic, Language, Information and Computation, WOLLIC 1999, Rio de Janeiro, Brazil, pp. 33–50 (1999)
Feferman, S., Kreisel, G.: Persistent and invariant formulas relative to theories of higher order. Bulletin of the American Mathematical Society 72, 480–485 (1966), Research Announcement
Feferman, S.: Persistent and invariant formulas for outer extensions. Compositio Mathematica 20, 29–52 (1968)
Halmos, P.: Algebraic Logic. Chelsea Publishing Company (1962)
Pinter, C.: A simple algebra of first order logic. Notre Dame Journal of Formal Logic 1, 361–366 (1973)
Andréka, H., Németi, I.: A simple, purely algebraic proof of the completeness of some first order logics. Algebra Universalis 5, 8–15 (1975)
ten Cate, B.: Model theory for extended modal languages. PhD thesis, University of Amsterdam, ILLC Dissertation Series DS-2005-01 (2005)
Blackburn, P., Cate, B.: Pure extensions, proof rules, and hybrid axiomatics. In: Schmidt, R., Pratt-Hartmann, I., Reynolds, M., Wansing, H. (eds.) Preliminary proceedings of Advances in Modal Logic (AiML 2004), Manchester (2004)
Koppelberg, S.: Handbook of boolean algebras, vol. 1. Elsevier, North-Holland (1989)
Tarski, A.: A simplified formalization of predicate logic with identity. Archiv für Mathematische Logik und Grundlagenforschung 7 (1965)
Henkin, L., Monk, J., Tarski, A.: Cylindric algebras, Part II. North Holland, Amsterdam (1985)
Andréka, H., Givant, S., Mikulás, S., Németi, I., Simon, A.: Notions of density that imply representability in algebraic logic. Annals of Pure and Applied Logic 91, 93–190 (1998)
Monk, D.: An introduction to cylindric set algebras (with an appendix by H. Andréka). Logic Journal of the IGPL 8, 451–506 (2000)
Van den Bussche, J.: Applications of Alfred Tarski’s ideas in database theory. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 20–37. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Litak, T. (2006). Algebraization of Hybrid Logic with Binders. In: Schmidt, R.A. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2006. Lecture Notes in Computer Science, vol 4136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11828563_19
Download citation
DOI: https://doi.org/10.1007/11828563_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37873-0
Online ISBN: 978-3-540-37874-7
eBook Packages: Computer ScienceComputer Science (R0)