Synthetic completeness proofs for Seligman-style tableau systems

MaRDI QIDQ4636041zbMATH OpenFDO

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

Publication date 23 April 2018

zbMATH Keywords

tense logicdifference operatorhybrid logicuniversal modalitytableausBridge rulepure axiomsSeligman-stylesynthetic completeness method

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Formalizing a Seligman-style tableau system for hybrid logic (short paper)
• Tableau method and NEXPTIME-completeness of DEL-sequents
• Completeness and termination for a Seligman-style tableau system
• Incorrect responses in first-order false-belief tests: a hybrid-logical formalization
• scientific article; zbMATH DE number 2024622 (Why is no real title available?)
• Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts

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)