Unwinding modal paradoxes on digraphs

DOI10.1007/S10992-020-09567-4OpenAlexW3071639002MaRDI QIDQ830367

Ming Hsiung

Publication date: 7 May 2021

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-020-09567-4

zbMATH Keywords

digraphliar paradoxtruth predicateYablo's paradoxnecessity predicate

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (1)

The elimination of direct self-reference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dangerous reference graphs and semantic paradoxes
• What truth depends on
• The elimination of self-reference: Generalized Yablo-series and the theory of truth
• Jump liars and Jourdain's card via the relativized T-scheme
• How truthlike can a predicate be? A negative result
• Truth and reflection
• Model theory.
• Boolean paradoxes and revision periods
• Possible-worlds semantics for modal notions conceived as predicates
• What paradoxes depend on
• An entirely non-self-referential Yabloesque paradox
• How to eliminate self-reference: a précis
• Yablo's paradox and \(\omega\)-inconsistency
• The Yablo Paradox
• Extending ω-consistent sets to maximally consistent, ω-complete sets
• Arithmetization of metamathematics in a general setting
• Paradox without Self-Reference
• Classes of Directed Graphs
• Yablo Without Gödel
• Patterns of paradox
• Revision Forever!
• Semantic paradoxes as equations.

This page was built for publication: Unwinding modal paradoxes on digraphs