- 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
The complexity of hybrid logics over equivalence relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
Natural deduction for first-order hybrid logic.Torben BraÜner - 2005 - Journal of Logic, Language and Information 14 (2):173-198.
Remarks on Gregory's “actually” operator.Patrick Blackburn & Maarten Marx - 2002 - Journal of Philosophical Logic 31 (3):281-288.
Expressivity of second order propositional modal logic.Balder ten Cate - 2006 - Journal of Philosophical Logic 35 (2):209-223.
Program constructions that are safe for bisimulation.Johan Van Benthem - 1998 - Studia Logica 60 (2):311-330.
Analytics
Added to PP
2010-06-04
Downloads
58 (#270,773)
6 months
11 (#222,787)
2010-06-04
Downloads
58 (#270,773)
6 months
11 (#222,787)
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-7c76586df8-hc2g5 uwo