Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2005.07050

On abstract F-systems. A graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks

Gustavo A. Bodanza
View original source ↗Read source document ↗Export metadata ↓

Abstract

F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and Yablo's can be analyzed with that tool to find graph-theoretic patterns. In this paper we present the F-systems model abstracting from all the features of the language in which the represented sentences are expressed. All that is assumed is the existence of sentences and the binary relation '... affirms the falsity of ...' among them. The possible existence of non-referential sentences is also considered. To model the sets of all the sentences that can jointly be valued as true we introduce the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enable to characterize referential contradictions, i.e. sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke's style fixed point characterization of groundedness is offered and fixed points which are complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) are put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of F-systems. We show the relation between local conglomerates and admissible sets of arguments and argue about the usefulness of the concept for argumentation theory.

Explore related subjects

math.LOcs.AI

Keep this discovery

BibTeXRIS

Gustavo A. Bodanza. 2020-05-14. On abstract F-systems. A graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks. https://arxiv.org/abs/2005.07050

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↗