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

DOI10.1007/S10849-023-09394-1MaRDI QIDQ6169322zbMATH OpenOpenAlexFDO

Authors Gustavo Adrián Bodanza

Publication date 14 August 2023

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.07050

zbMATH Keywords

\( \mathcal{F} \)-systemargumentation frameworksconglomeratesgroundednessliar paradoxYablo's paradox

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

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.

Cites work

• A graph-theoretic analysis of the semantic paradoxes
• Conjunction and disjunction in infectious logics
• Dangerous reference graphs and semantic paradoxes
• Defining LFIs and LFUs in extensions of infectious logics
• Embracing intensionality: paradoxicality and semi-truth operators in fixed point models
• Notes on the mathematical aspects of Kripke's theory of truth
• On kernels and semikernels of digraphs
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the Issue of Reinstatement in Argumentation
• Outline of a Theory of Truth
• Paradox without Self-Reference
• Patterns of paradox
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Reference, paradoxes and truth
• The Yablo paradox. An essay on circularity
• Yablo's paradox

This page was built for publication: On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169322)