Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1705.09735

Intuitionistic Existential Graphs from a non traditional point of view

Yuri A. Poveda·Steven Zuluaga
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we develop a new version of the intuitionist existential graphs presented by Arnol Oostra [4]. The deductive rules presented in this article have the same meaning as those described in the work of Yuri Poveda [5], because the deductions according to the parity of the cuts are eliminated and are replaced by a finite set of recursive rules. This way, $ Alfa_I $ the existential graphs system for intuitional propositional logic follows the course of the deductive rules of the system $ Alfa_0 $ described by Poveda [5], and is equivalent to the intuitionistic propositional calculus. In this representation the $ Alfa_0 $ system is improved, there are a series of deductive rules of second degree incorporated that previously had not been considered and that allow a better management of deductions and finally from the ideas proposed by Van Dalen [6], a mixture is incorporated in the deduction techniques, the natural deductions of the Gentzen system are combined with new system rules $ Alfa_0 $ and $ Alfa_I $. The symbols proposed for the $Alfa_I$ representation relate open, closed and quasi-open sets of the usual topology of the plot with the intuitional propositional logic, usefull for approaching new problems in the representation of this logic from a more geometrical perspective.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Yuri A. Poveda, Steven Zuluaga. 2017-05-26. Intuitionistic Existential Graphs from a non traditional point of view. https://arxiv.org/abs/1705.09735

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↗