Tableau methodology for propositional logics
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915629525630976 |
|---|---|
| author | Jarmuzek, T. Gore, R. |
| author_facet | Jarmuzek, T. Gore, R. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16781 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tableau methodology for propositional logics Jarmuzek, T. Gore, R. Logic in Computer Science Logic 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. |
| title | Tableau methodology for propositional logics |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2511.16781 |