2025/11/20 by Tomasz Jarmużek, Jarmuzek, T., Rajeev Goré +1
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.2511.16781
openalex publication_date 2025/11/20 · openalex created_date 2025/11/25 · openalex updated_date 2026/07/28
We set out a general methodology for producing tableau systems for propositional logics via a tableau metatheory that provides general and formal notions for different tableau systems that vary by semantics or formulae. Moreover, by dint of these general notions, some facts, independent of their applications to a particular propositional logic, can be proved. One of the examples is the tableau metatheorem that simplifies the process of constructing a complete tableau system for a given logic, just reducing it to checking specific properties of the tableau rules within the analyzed, particular system. In our paper we generalize an abstract consistency property proposed by R. Smullyan and M. Fitting from the modal case to the others. Such a methodology is essential for a deeper and universal treatment of tableau methods for various propositional languages and semantics.