Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.02035

Caracterizaci\'on sem\'antico-deductiva de la l\'ogica doble LD y los gr\'aficos existenciales Gamma-LD

Manuel Sierra Aristizábal
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for the principle of the excluded third when one of the disjunctions is one of the alternate operators. The LD system includes as theorems, the theorems of the Classic Propositional Logic LC. In LD, the intuitionist connec-tives are recovered from the classics and the alternates, which implies that, the LD system includes as theorems, the theorems of the Propositional Intuitionist Logic LI. It is rigorously and detailed to prove that theorems of con-sistency, validity and completeness. It illustrates LD's ability to fix a version of the liar's paradox, where LC and LI fail. Finally, the location of the LD system is precisely determined in relation to the systems that made it possi-ble to intuit the structure of LD, such as, Basic Logic for the Aristotelian Truth LBVA, the Logic of Tautologies LT and the Basic Logic for Truth and Falsehood LBVF. LD is characterized by Gamma-LD Existential Graphs, in the style of Peirce, so the semantics of possible worlds presented in this work also characterizes Gamma-LD.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Manuel Sierra Aristizábal. 2023-10-03. Caracterizaci\'on sem\'antico-deductiva de la l\'ogica doble LD y los gr\'aficos existenciales Gamma-LD. https://arxiv.org/abs/2310.02035

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↗