A Note on Positive Equivalence Relations

DOI10.1002/MALQ.19870330106MaRDI QIDQ3026990zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1987

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19870330106

zbMATH Keywords

positive equivalence relationr.e. relationuniversal objects

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• On weakly pre-complete positive equivalences
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• On Some Properties of Recursively Enumerable Equivalence Relations
• Positive preorders
• Maximal r.e. equivalence relations

Cited in

(34)

• Comments on ``Aggregation of equivalence relations by P. C. Fishburn and A. Rubinstein
• On a conjecture of Bergstra and Tucker
• On dark computably enumerable equivalence relations
• Jumps of computably enumerable equivalence relations
• Precomplete numberings
• Special classes of positive preorders
• Partial combinatory algebra and generalized numberings
• Index sets for classes of positive preorders
• On computably enumerable structures
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Fixed point theorems for precomplete numberings
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Graphs realised by r.e. equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• Positivity relations on a locale
• A survey on universal computably enumerable equivalence relations
• The complexity of index sets of classes of computably enumerable equivalence relations
• On Σ¹ ₁ equivalence relations over the natural numbers
• A Friedberg enumeration of equivalence structures
• scientific article; zbMATH DE number 6103846 (Why is no real title available?)
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
• Fixpoints and relative precompleteness
• On isomorphism classes of computably enumerable equivalence relations
• On Positive Relational Calculi
• Application of precomplete enumerations to tabular-type degrees and index sets
• Fixed points and unfounded chains
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• A note on joins and meets for positive linear preorders
• Computably enumerable equivalence relations via primitive recursive reductions
• Defining algorithmically presented structures in first order logic
• On weakly pre-complete positive equivalences
• Positive definitions of segment congruence in terms of segment inequality
• Reducibilities among equivalence relations induced by recursively enumerable structures

This page was built for publication: A Note on Positive Equivalence Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026990)