Premium
Remarks on Uniformly Finitely Precomplete Positive Equivalences
Author(s) -
Yu. Shavrukov V.
Publication year - 1996
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19960420107
Subject(s) - mathematics , finitely generated abelian group , equivalence (formal languages) , endomorphism , equivalence relation , mathematics subject classification , pure mathematics , extension (predicate logic) , discrete mathematics , computer science , programming language
The paper contains some observations on e‐complete, precomplete, and uniformly finitely precomplete r. e. equivalence relations. Among these are a construction of a uniformly finitely precomplete r. e. equivalence which is neither e‐ nor precomplete, an extension of Lachlan's theorem that all precomplete r. e. equivalences are isomorphic, and a characterization of sets of fixed points of endomorphisms of uniformly finitely precomplete r. e. equivalences. Mathematics Subject Classification: 03D45.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom