Simple cut elimination proof for hybrid logic

DOI10.12775/LLP.2016.004zbMath1377.03051OpenAlexW2313748468MaRDI QIDQ2987759

Andrzej Indrzejczak

Publication date: 18 May 2017

Published in: Logic and Logical Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12775/llp.2016.004

zbMATH Keywords

hybrid logicgeometric conditionssequent calculihypersequent calculicut elimination theorem

Mathematics Subject Classification ID

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

Related Items (2)

A novel approach to equality ⋮ Fregean Description Theory in Proof-Theoretical Setting

Cites Work

• Natural deduction, hybrid systems and modal logics
• Nominal tense logic
• Proof analysis in modal logic
• Modal logic with names
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• Internalization: The Case of Hybrid Logics
• Tableau-based Decision Procedures for Hybrid Logic
• Natural Deduction for Hybrid Logic
• Internalizing labelled deduction
• First-order hybrid logic: introduction and survey
• Modal Hybrid Logic
• Hybrid logic and its proof-theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple cut elimination proof for hybrid logic