Skip to main content
Article thumbnail
Location of Repository

Coinductive Predicates and Final Sequences in a Fibration

By Ichiro Hasuo, Kenta Cho, Toshiki Kataoka and Bart Jacobs

Abstract

Coinductive predicates express persisting “safety ” specifications of transition systems. Previous observations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebras in a fibration—a categorical abstraction of predicate logic. In this paper we follow the spirit of a seminal work by Worrell and study final sequences in a fibration. Our main contribution is to identify some categorical “size restriction ” axioms that guarantee stabilization of final sequences after ω steps. In its course we develop a relevant categorical infrastructure that relates fibrations and locally presentable categories, a combination that does not seem to be studied a lot. The genericity of our fibrational framework can be exploited for: binary relations (i.e. the logic of “binary predicates”) for which a coinductive predicate is bisimilarity; constructive logics (where interests are growing in coinductive predicates); and logics for name-passing processes

Topics: coalgebra, co)recursive predicate, modal logic, fibration, locally presentable category
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.306.4485
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-mmm.is.s.u-tokyo.ac... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.