Birkhoff style calculi for hybrid logics

DOI10.1007/s00165-016-0414-yzbMath1420.03037OpenAlexW2585755888MaRDI QIDQ1682285

Daniel Găină

Publication date: 29 November 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0414-y

zbMATH Keywords

hybrid logicHorn clauseinstitutionreconfigurable systemBirkhoff calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (4)

Logics for actor networks: a two-stage constrained-hybridisation approach ⋮ Stability of termination and sufficient-completeness under pushouts via amalgamation ⋮ Hybridisation of Institutions in HETS (Tool Paper). ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

Uses Software

• CASL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal logic: An anthology. From Paul Hertz to Dov Gabbay
• An essay in combinatory dynamic logic
• Birkhoff completeness in institutions
• Quasi-varieties in abstract algebraic institutions
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Adding a temporal dimension to a logic system
• Logical foundations of CafeOBJ
• CASL: the Common Algebraic Specification Language.
• Interpolation in logics with constructors
• Refinement in hybridised institutions
• Foundations of logic programming in hybrid logics with user-defined sharing
• Stratified institutions and elementary homomorphisms
• Herbrand theorems in arbitrary institutions
• Analysis and synthesis of logics. How to cut and paste reasoning systems
• Institution-independent model theory
• Bringing them all Together
• Foundations of Logic Programming in Hybridised Logics
• Quasi-varieties and initial semantics for hybridized institutions
• Borrowing interpolation
• Completeness by Forcing
• Hybridization of Institutions
• Combinations and completeness transfer for quantified modal logics
• Implicit Kripke semantics and ultraproducts in stratified institutions
• Combinatorics of $\lambda$-terms: a natural approach
• Proof Systems for Institutional Logic
• An Institutional Version of Gödel’s Completeness Theorem
• Institutions: abstract model theory for specification and programming
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Revisiting the Institutional Approach to Herbrand’s Theorem
• Encoding hybridized institutions into first-order logic
• Completeness in the theory of types
• Hybrid logic and its proof-theory

This page was built for publication: Birkhoff style calculi for hybrid logics