Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
From MaRDI portal
Publication:3677759
DOI10.4064/fm-124-3-221-233zbMath0564.03043OpenAlexW818805751MaRDI QIDQ3677759
Franco Montagna, Claudio Bernardi
Publication date: 1984
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/211552
equivalence relationsfixed pointprovabilityfirst order arithmetictheory of numerationsextensional formulashyperdiagonalizable algebras
First-order arithmetic and fragments (03F30) Theory of numerations, effectively presented structures (03D45)
Related Items
Hyperdiagonalizable algebras ⋮ Generic generalized Rosser fixed points ⋮ UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ On a conjecture of Bergstra and Tucker ⋮ Arithmetical completeness theorems for monotonic modal logics ⋮ Jumps of computably enumerable equivalence relations ⋮ Obituary: Franco Montagna (1948--2015) ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Precomplete Equivalence Relations in Dominical Categories ⋮ Weakly precomplete computably enumerable equivalence relations ⋮ Calculating self-referential statements. I: Explicit calculations ⋮ Rosser and Mostowski sentences ⋮ A NOTE ON DERIVABILITY CONDITIONS ⋮ Rosser provability and the second incompleteness theorem ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS