- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A bisimulation characterization theorem for hybrid logic with the current-state Binder
Review of Symbolic Logic 3 (2):247-261 (2010)
Abstract
We prove that every first-order formula that is invariant under quasi-injective bisimulations is equivalent to a formula of the hybrid logic . Our proof uses a variation of the usual unravelling technique. We also briefly survey related results, and show in a standard way that it is undecidable whether a first-order formula is invariant under quasi-injective bisimulationsLinks
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- journals.cambridge.org (no proxy)
- journals.cambridge.org [2] (no proxy)
- journals.cambridge.org [3] (no proxy)
- journals.cambridge.org [4] (no proxy)
- journals.cambridge.org [5] (no proxy)
- doc.ic.ac.uk
(no proxy) - journals.cambridge.org [6] (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Model-theoretic characterization of intuitionistic propositional formulas.Grigory K. Olkhovikov - 2013 - Review of Symbolic Logic 6 (2):348-365.
A correspondence theorem for interpretability logic with respect to Verbrugge semantics.Sebastijan Horvat & Tin Perkov - forthcoming - Logic Journal of the IGPL.
Program constructions that are safe for bisimulation.Johan Van Benthem - 1998 - Studia Logica 60 (2):311-330.
Towards a characterization of order-invariant queries over tame graphs.Michael A. Benedikt & Luc Segoufin - 2009 - Journal of Symbolic Logic 74 (1):168-186.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Presburger arithmetic, rational generating functions, and quasi-polynomials.Kevin Woods - 2015 - Journal of Symbolic Logic 80 (2):433-449.
Modal characterisation theorems over special classes of frames.Anuj Dawar & Martin Otto - 2010 - Annals of Pure and Applied Logic 161 (1):1-42.
Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
Analytics
Added to PP
2010-06-04
Downloads
60 (#261,687)
6 months
13 (#276,402)
2010-06-04
Downloads
60 (#261,687)
6 months
13 (#276,402)
Historical graph of downloads
References found in this work
Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
Modal logic and classical logic.Johan van Benthem - 1983 - Atlantic Highlands, N.J.: Distributed in the U.S.A. by Humanities Press.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-ktvwr uwo