Abstract
This paper is about non-labelled proof-systems for hybrid logic, that is, proof-systems where arbitrary formulas can occur, not just satisfaction statements. We give an overview of such proof-systems, focusing on analytic systems: Natural deduction systems, Gentzen sequent systems and tableau systems. We point out major results and we discuss a couple of striking facts, in particular that non-labelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Bulletin of the Section of Logic |
Vol/bind | 51 |
Udgave nummer | 2 |
Sider (fra-til) | 143-162 |
Antal sider | 20 |
ISSN | 0138-0680 |
DOI | |
Status | Udgivet - jun. 2022 |