On abstract F-systems. A graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks
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.
Code (0)
등록된 구현이 없습니다.
Tasks
SentenceSimilar Papers 제목 키워드 기반
Deontic Paradoxes in ASP with Weak Constraints
The rise of powerful AI technology for a range of applications that are sensitive to legal, social, and ethical norms demands decision-making support in presence of norms and regulations. Normative reasoning is the realm…
Decision Making[WIP] Jailbreak Paradox: The Achilles' Heel of LLMs
We introduce two paradoxes concerning jailbreak of foundation models: First, it is impossible to construct a perfect jailbreak classifier, and second, a weaker model cannot consistently detect whether a stronger (in a pa…
A Proposal to Extend Expected Utility in a Quantum Probabilistic Framework
Expected utility theory (EUT) is widely used in economic theory. However, its subjective probability formulation, first elaborated by Savage, is linked to Ellsberg-like paradoxes and ambiguity aversion. This has led vari…
Decision MakingDecision Making Under UncertaintyParadoxical Oddities in Two Multiwinner Elections from Scotland
Ranked-choice voting anomalies such as monotonicity paradoxes have been extensively studied through creating hypothetical examples and generating elections under various models of voter behavior. However, very few real-w…
Using Differential Geometry to Revisit the Paradoxes of the Instantaneous Frequency
This paper proposes a general framework to interpret the concept of Instantaneous Frequency (IF) in three-phase systems. The paper first recalls the conventional frequency-domain analysis based on the Fourier transform a…