Synthetic completeness proofs for Seligman-style tableau systems

zbMATH Open1400.03045MaRDI QIDQ4636041FDOQ4636041

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

Publication date: 23 April 2018

Recommendations

• Completeness and termination for a Seligman-style tableau system
• A Seligman-Style Tableau System
• scientific article; zbMATH DE number 1341482
• Hybrid completeness
• Modal Hybrid Logic

zbMATH Keywords

tense logicdifference operatorhybrid logicuniversal modalitytableausBridge rulepure axiomsSeligman-stylesynthetic completeness method

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Cited In (5)

• Incorrect Responses in First-Order False-Belief Tests: A Hybrid-Logical Formalization
• Tableau method and NEXPTIME-completeness of DEL-sequents
• Title not available (Why is that?)
• Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts
• Formalizing a Seligman-style tableau system for hybrid logic (short paper)

This page was built for publication: Synthetic completeness proofs for Seligman-style tableau systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636041)