Implementing analytic tableaux for justification logic
Publication date
Authors
DOI
Document Type
Master Thesis
Metadata
Show full item recordCollections
License
CC-BY-NC-ND
Abstract
This Master's thesis presents new decidable tableau systems for the justification logics J and LP, and proves their soundness and completeness by providing a proof of cut-elimination. The accompanying Haskell software, "judge", is able to automatically construct tableaux for any tableau systems defined by the user, including the proposed system. The crux lies in its ability to deal with systems in which the expansion rules may introduce formulas that are not subterms of formulas that previously occurred on the branch.
Keywords
logic, formal logic, justification logic, justification, logic of proofs, tableau, method of analytic tableaux, epistemic, knowledge, belief, provability, satisfiability, validity, consistency, proof search, theorem proving, decision procedure, decidability, subformula property, soundness, completeness, proof tree, evidence, complexity, haskell, implementation, program, software, tool, application, derivation, formula