scholarly journals One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past

2020 ◽  
pp. 104599
Author(s):  
Luca Geatti ◽  
Nicola Gigante ◽  
Angelo Montanari ◽  
Mark Reynolds
Keyword(s):  
Studia Logica ◽  
2018 ◽  
Vol 106 (6) ◽  
pp. 1261-1289
Author(s):  
Andrzej Pietruszczak ◽  
Tomasz Jarmużek
Keyword(s):  

1979 ◽  
Vol 25 (32) ◽  
pp. 511-512
Author(s):  
Michael A. McRobbie ◽  
Robert K. Meyer
Keyword(s):  

Author(s):  
Torben Braüner

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.


Sign in / Sign up

Export Citation Format

Share Document