Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts

Bulletin of the Section of Logic 51 (2):143-162 (2022)
  Copy   BIBTEX

Abstract

This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems 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 nonlabelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2022-08-27

Downloads
16 (#1,188,084)

6 months
3 (#1,471,287)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

On an intuitionistic modal logic.G. M. Bierman & V. C. V. de Paiva - 2000 - Studia Logica 65 (3):383-416.
Hybrid-Logical Reasoning in the Smarties and Sally-Anne Tasks.Torben Braüner - 2014 - Journal of Logic, Language and Information 23 (4):415-439.
A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
Two natural deduction systems for hybrid logic: A comparison. [REVIEW]Torben Braüner - 2004 - Journal of Logic, Language and Information 13 (1):1-23.

Add more references