T-BAT semantics and its logics
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911214192295936 |
|---|---|
| author | Pawlowski, Pawel |
| author_facet | Pawlowski, Pawel |
| contents | \textbf{T-BAT} logic is a formal system designed to express the notion of informal provability. This type of provability is closely related to mathematical practice and is quite often contrasted with formal provability, understood as a formal derivation in an appropriate formal system. \textbf{T-BAT} is a non-deterministic four-valued logic. The logical values in \textbf{T-BAT} semantics convey not only the information whether a given formula is true but also about its provability status.
The primary aim of our paper is to study the proposed four-valued non-deterministic semantics. We look into the intricacies of the interactions between various weakenings and strengthenings of the semantics with axioms that they induce. We prove the completeness of all the logics that are definable in this semantics by transforming truth values into specific expressions formulated within the object language of the semantics. Additionally, we utilize Kripke semantics to examine these axioms from a modal perspective by providing a frame condition that they induce. The secondary aim of this paper is to provide an intuitive axiomatization of \textbf{T-BAT} logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_14361 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | T-BAT semantics and its logics Pawlowski, Pawel Logic in Computer Science \textbf{T-BAT} logic is a formal system designed to express the notion of informal provability. This type of provability is closely related to mathematical practice and is quite often contrasted with formal provability, understood as a formal derivation in an appropriate formal system. \textbf{T-BAT} is a non-deterministic four-valued logic. The logical values in \textbf{T-BAT} semantics convey not only the information whether a given formula is true but also about its provability status. The primary aim of our paper is to study the proposed four-valued non-deterministic semantics. We look into the intricacies of the interactions between various weakenings and strengthenings of the semantics with axioms that they induce. We prove the completeness of all the logics that are definable in this semantics by transforming truth values into specific expressions formulated within the object language of the semantics. Additionally, we utilize Kripke semantics to examine these axioms from a modal perspective by providing a frame condition that they induce. The secondary aim of this paper is to provide an intuitive axiomatization of \textbf{T-BAT} logic. |
| title | T-BAT semantics and its logics |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2510.14361 |