Completeness and termination for a Seligman-style tableau system

@article{Blackburn2017CompletenessAT,
  title={Completeness and termination for a Seligman-style tableau system},
  author={Patrick Blackburn and Thomas Bolander and Torben Bra{\"u}ner and Klaus Frovin J{\o}rgensen},
  journal={J. Log. Comput.},
  year={2017},
  volume={27},
  pages={81-107}
}
Proof systems for hybrid logic typically use @-operators to access information hidden behind modalities; this labelling approach lies at the heart of the best known hybrid resolution, natural deduction, and tableau systems. But there is another approach, which we have come to believe is conceptually clearer. We call this Seligman-style inference, as it was rst introduced and explored by Jerry Seligman in natural deduction [31] and sequent calculus [32] in the 1990s. The purpose of this paper is… 

Synthetic completeness proofs for Seligman-style tableau systems

TLDR
The present paper adapts the synthetic approach to tableau completeness so that it can directly build maximal consistent sets of tableau blocks.

Synthetic Completeness for a Terminating Seligman-Style Tableau System

TLDR
This work presents a Seligman-style tableau system with a formalization in the proof assistant Isabelle/HOL and claims termination from this relationship, the first synthetic completeness proof for a terminating hybrid logic tableauSystem.

Formalizing a Seligman-Style Tableau System for Hybrid Logic

TLDR
This work formalizes soundness and completeness proofs for a Seligman-style tableau system for hybrid logic in the proof assistant Isabelle/HOL and shows how to lift certain rule restrictions, thereby simplifying the original un-formalized proof.

PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS

TLDR
A deductive system for Lewis counterfactuals is presented, based directly on the influential generalisation of relational semantics through ternary similarity relations introduced by Lewis, and is shown to be equivalent to the axiomatic system VC of Lewis.

Incorrect Responses in First-Order False-Belief Tests: A Hybrid-Logical Formalization

TLDR
The remarkable fact that the incorrect answers can be derived using logically correct rules indicates that the origin of the mistakes does not lie in the children’s logical reasoning, but rather in a wrong interpretation of the task.

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

  • T. Braüner
  • Computer Science, Mathematics
    Bulletin of the Section of Logic
  • 2022
TLDR
This paper discusses 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.

References

SHOWING 1-10 OF 38 REFERENCES

A Seligman-Style Tableau System

TLDR
The purpose of this paper is to introduce a Seligman-style tableau system for proof systems for hybrid logic, first introduced and explored by JerrySeligman in the setting of natural deduction and sequent calculus in the late 1990s.

Tableau methods of proof for modal logics

TLDR
This paper incorporates the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order tableau system, with the modal operators behaving like quantifiers.

Termination for Hybrid Tableaus

TLDR
This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Brauner and defines a internalised system which terminates without loop-checks, simpler than previously known internalised systems and simpler than the prefix systems.

Internalizing labelled deduction

TLDR
This paper shows how to internalize the Kripke satisfaction definition using the basic hybrid language and explores the proof theoretic consequences of doing so, and concludes with some reflections on the status of labelling in modal logic.

Direct resolution for modal-like logics

TLDR
A resolution calculus for hybrid logics addressing these problems: the hybrid machinery is used to “push formulas out of modalities” and in this way, feed them into a simple and standard resolution rule.

Proofs and Countermodels in Non-Classical Logics

TLDR
A method is presented that makes it possible to establish completeness in a direct way: for any given sequent either a proof in the given logical system or a countermodel in the corresponding frame class is found.

Tableaux for Quantified Hybrid Logic

We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual ? and ? modalities it contains names

Prefixed tableaus and nested sequents

  • M. Fitting
  • Computer Science
    Ann. Pure Appl. Log.
  • 2012

HTab: a Terminating Tableaux System for Hybrid Logic

Tableau Calculi for Hybrid Logics

TLDR
This work presents prefixed tableau calculi for weak hybrid logics (proper fragments of classical logic) as well as for hybridlogics having full first-order expressive power, and gives a general method for proving completeness.