Completeness and termination for a Seligman-style tableau system-Reference-Cited by-同舟云学术

Completeness and termination for a Seligman-style tableau system

Published:2015-09-28 Issue:1 Volume:27 Page:81-107
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:J Logic Computation

Author:

Blackburn Patrick,Bolander Thomas,Braüner Torben,Jørgensen Klaus Frovin

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/27/1/81/9688543/exv052.pdf

Reference34 articles.

1. Ordered Resolution with Selection for $\mathcal{H}(@)$

2. Resolution with Order and Selection for Hybrid Logics

3. C. Areces and J. Heguiabehere. Direct resolution for modal-like logics. In Proceedings of the 3rd International Workshop on the Implementation of Logics. pp. 3–16. Tbilisi, Georgia, 2002.

4. Basin D. D'Agostino M. Gabbay D. Matthews S. Viganò L. Labelled Deduction, Applied Logic Series, vol. 17. Kluwer Academic Publishers, 2000.

5. Internalizing labelled deduction

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Completeness of tableau calculi for two-dimensional hybrid logics;Journal of Logic and Computation;2024-04-18

2. Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts;Bulletin of the Section of Logic;2022-01-07

3. Incorrect Responses in First-Order False-Belief Tests: A Hybrid-Logical Formalization;Logic and Logical Philosophy;2020-02-17

4. Formalizing a Seligman-Style Tableau System for Hybrid Logic;Automated Reasoning;2020