Hybridization of Institutions

Modal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new results and techniques as well as applications to software specification. In this context, the first contribution of this paper is an attempt to 'universalize' the hybridization idea. Following the lines of [15], where a method to modalize arbitrary institutions is presented, the paper introduces a method to hybridize logics at the same institution-independent level. The method extends arbitrary institutions with Kripke semantics (for multi-modalities with arbitrary arities) and hybrid features. This paves the ground for a general result: any encoding (expressed as comorphism) from an arbitrary institution to first order logic (FOL) determines a comorphism from its hybridization to FOL. This second contribution opens the possibility of effective tool support to specification languages based upon logics with hybrid features.

[1]  Torben Braüner,et al.  Natural Deduction for First-Order Hybrid Logic , 2005, J. Log. Lang. Inf..

[2]  Valeria C V de Paiva,et al.  Intuitionistic Hybrid Logic , 2006 .

[3]  Torben Braüner,et al.  Many-valued hybrid logic , 2018, Advances in Modal Logic.

[4]  R. C.,et al.  A Hybrid Intuitionistic Logic : Semantics and Decidability , 2005 .

[5]  Stéphane Demri,et al.  On the freeze quantifier in constraint LTL: decidability and complexity , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[6]  Patrick Blackburn,et al.  Bringing them all Together , 2001, J. Log. Comput..

[7]  Manuel A. Martins,et al.  Reasoning about complex requirements in a uniform setting , 2011 .

[8]  T. Braüner.  Hybrid Logic and its Proof-Theory , 2010 .

[9]  Ulrike Sattler,et al.  The Hybrid µ-Calculus , 2001, IJCAR.

[10]  Volker Weber.  On the Complexity of Branching-Time Logics , 2009, CSL.

[11]  Razvan Diaconescu.  Quasi-boolean encodings and conditionals in algebraic specification , 2010, J. Log. Algebraic Methods Program..

[12]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[13]  Torben Bra.  Natural Deduction for First-Order Hybrid Logic , 2005 .

[14]  Razvan Diaconescu,et al.  Ultraproducts and possible worlds semantics in institutions , 2007, Theor. Comput. Sci..

[15]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[16]  Thomas Schwentick,et al.  On the Hybrid Extension of CTL and CTL+ , 2009, MFCS.

[17]  Grigore Rosu,et al.  Institution Morphisms , 2013, Formal Aspects of Computing.

[18]  R. Diaconescu.  Institution-independent model theory , 2008 .

[19]  Mihai Codescu,et al.  Birkhoff Completeness in Institutions , 2008, Logica Universalis.

[20]  Tomasz Borzyszkowski.  Logical systems for structured specifications , 2002, Theor. Comput. Sci..

[21]  Razvan Diaconescu.  Elementary Diagrams in Institutions , 2004, J. Log. Comput..

[22]  D. Holdstock.  Past, present--and future? , 2005, Medicine, conflict, and survival.

[23]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[24]  Joseph A. Goguen,et al.  The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.

[25]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..