Normal proofs and tableaux for the Font-Rius tetravalent modal logic

Marcelo Coniglio; Martín Figallo

Home/Archive/arXiv

arXiv · 2305.00130

Normal proofs and tableaux for the Font-Rius tetravalent modal logic

Marcelo Coniglio·Martín Figallo

View original source ↗Read source document ↗Export metadata ↓

Abstract

Tetravalent modal logic (T ML) was introduced by Font and Rius in 2000; and it is an expansion of the Belnap-Dunn four{valued logic FOUR, a logical system that is well{known for the many applications it has been found in several fields. Besides, T ML is the logic that preserve degrees of truth with respect to Monteiro's tetravalent modal algebras. Among other things, Font and Rius showed that T ML has a strongly adequate sequent system, but unfortunately this system does not enjoy the cut-elimination property. However, in [16], it was presented a sequent system for T ML with the cut{elimination property. Besides, in this same work, it was also presented a sound and complete natural deduction system for this logic. In the present work, we continue with the study of T ML under a proof-theoretic perspective. In first place, we show that the natural deduction system given in [16] admits a normalization theorem. In second place, taking advantage of the contrapositive implication for the tetravalent modal algebras introduced in [17], we define a decidable tableau system adequate to check validity in the logic T ML. Finally, we provide a sound and complete tableau system for T ML in the original language.These two tableau systems constitute new (proof-theoretic) decision procedures for checking validity in the variety of tetravalent modal algebras.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Marcelo Coniglio, Martín Figallo. 2023-04-29. Normal proofs and tableaux for the Font-Rius tetravalent modal logic. https://arxiv.org/abs/2305.00130

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗