Internalization: The Case of Hybrid Logics

DOI10.1093/logcom/11.5.671zbMath0991.03024OpenAlexW2040173145MaRDI QIDQ2772880

Jeremy Seligman

Publication date: 29 August 2002

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/856c1727dc07be0c5c104c393759e3b24a4be03b

zbMATH Keywords

sequent calculushybrid logicinternalization

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Related Items (12)

Operators vs. arguments: The ins and outs of reification ⋮ Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts ⋮ Simple cut elimination proof for hybrid logic ⋮ Recapturing dynamic logic of relation changers via bounded morphisms ⋮ An Analytic Logic of Aggregation ⋮ A Two-Dimensional Hybrid Logic of Subset Spaces ⋮ Coalgebraic Hybrid Logic ⋮ A proof-theoretic study of the correspondence of hybrid logic and classical logic ⋮ ExpTime tableaux with global caching for hybrid PDL ⋮ Sequent calculi and decidability for intuitionistic hybrid logic ⋮ Why does the proof-theory of hybrid logic work so well? ⋮ Formalizing a Seligman-style tableau system for hybrid logic (short paper)

This page was built for publication: Internalization: The Case of Hybrid Logics