Formalizing a Seligman-Style Tableau System for Hybrid Logic-Reference-Cited by-同舟云学术

Formalizing a Seligman-Style Tableau System for Hybrid Logic

Published:2020 Issue: Volume: Page:474-481
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

From Asta Halkjær^ORCID,Blackburn Patrick^ORCID,Villadsen Jørgen^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-51074-9_27

Reference25 articles.

1. Areces, C., Blackburn, P., Marx, M.: Hybrid logics: characterization, interpolation and complexity. J. Symb. Logic 66(3), 977–1010 (2001)

2. Areces, C.E.: Logic engineering: the case of description and hybrid logics. Ph.D. thesis, Institute for Logic, Language and Computation, Amsterdam, The Netherlands (2000)

3. Berghofer, S.: First-Order Logic According to Fitting. Archive of Formal Proofs, August 2007. http://isa-afp.org/entries/FOL-Fitting.html . Formal proof development

4. Blackburn, P.: Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic J. IGPL 8(3), 339–365 (2000). https://doi.org/10.1093/jigpal/8.3.339

5. Blackburn, P., Bolander, T., Braüner, T., Jørgensen, K.F.: Completeness and termination for a Seligman-style tableau system. J. Logic Comput. 27(1), 81–107 (2017). https://doi.org/10.1093/logcom/exv052

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

1. Formalizing Henkin-Style Completeness of an Axiomatic System for Propositional Logic;Selected Reflections in Language, Logic, and Information;2023-12-28

2. Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory;Automated Deduction – CADE 29;2023

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

4. Formalized Soundness and Completeness of Epistemic Logic;Logic, Language, Information, and Computation;2021