Completeness and termination for a Seligman-style tableau system
From MaRDI portal
Publication:2987043
DOI10.1093/logcom/exv052zbMath1444.03045DBLPjournals/logcom/BlackburnBBJ17OpenAlexW2272278096WikidataQ50355423 ScholiaQ50355423MaRDI QIDQ2987043
Thomas Bolander, Patrick Blackburn, Torben Braüner, Klaus Frovin Jørgensen
Publication date: 17 May 2017
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/a5b0c349-daa7-4075-a9d7-2654d9cfa645
Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (3)
Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts ⋮ Incorrect Responses in First-Order False-Belief Tests: A Hybrid-Logical Formalization ⋮ Formalizing a Seligman-style tableau system for hybrid logic (short paper)
Uses Software
This page was built for publication: Completeness and termination for a Seligman-style tableau system
