Fixed points and unfounded chains

DOI10.1016/S0168-0072(00)00061-0zbMath0985.03052MaRDI QIDQ5939843

Claudio Bernardi

Publication date: 13 May 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

paradox; fixed point; diagonalizable algebra; hypergame; incompleteness; non-wellfounded relation; self-reference; unfounded chain; ungrounded sentence

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

06E25: Boolean algebras with additional operations (diagonalizable algebras, etc.)

03D45: Theory of numerations, effectively presented structures

03F45: Provability logics and related algebras (e.g., diagonalizable algebras)

Related Items

A Yabloesque paradox in epistemic game theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-reference and modal logic
• Ungroundedness in classical languages
• The fixed-point theorem for diagonalizable algebras. (The algebraization of the theories which express Theor. III.)
• An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
• Least fixed points in the Gödel-Löb logic
• Translating the hypergame paradox: Remarks on the set of founded elements of a relation
• A Note on Positive Equivalence Relations
• Classifying positive equivalence relations
• Playing Games with Games: The Hypergame Paradox
• Complete, Recursively Enumerable Relations in Arithmetic
• Undecidability in diagonalizable algebras
• Outline of a Theory of Truth
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• Paradox of the class of all grounded classes