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

DOI10.1007/s10849-023-09394-1arXiv2005.07050OpenAlexW4321110477MaRDI QIDQ6169322

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

liar paradoxgroundednessYablo's paradoxargumentation frameworksconglomerates\( \mathcal{F} \)-system

Mathematics Subject Classification ID

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

Cites Work

• Dangerous reference graphs and semantic paradoxes
• On kernels and semikernels of digraphs
• Notes on the mathematical aspects of Kripke's theory of truth
• Conjunction and disjunction in infectious logics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Reference, paradoxes and truth
• The Yablo Paradox
• Embracing intensionality: Paradoxicality and semi-truth operators in fixed point models
• On the Issue of Reinstatement in Argumentation
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Yablo's paradox
• Paradox without Self-Reference
• Outline of a Theory of Truth
• Defining LFIs and LFUs in extensions of infectious logics
• A GRAPH-THEORETIC ANALYSIS OF THE SEMANTIC PARADOXES
• Patterns of 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