A Friedberg enumeration of equivalence structures-Reference-Cited by-同舟云学术

A Friedberg enumeration of equivalence structures

Published:2017-11-27 Issue:02 Volume:17 Page:1750008
ISSN:0219-0613
Container-title:Journal of Mathematical Logic
language:en
Short-container-title:J. Math. Log.

Author:

Downey Rodney G.¹,Melnikov Alexander G.²,Ng Keng Meng³

Affiliation:

1. School of Mathematics and Statistics, Victoria University of Wellington, P. O. Box 600, Wellington, New Zealand

2. The Institute of Natural and Mathematical Sciences, Private Bag 102 904, NSMC Albany 0745, Auckland, New Zealand

3. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, Singapore 637371, Singapore

Abstract

We solve a problem posed by Goncharov and Knight (Problem 4 in [S. Goncharov and J. Knight, Computable structure and antistructure theorems, Algebra Logika 41(6) (2002) 639–681, 757]). More specifically, we produce an effective Friedberg (i.e. injective) enumeration of computable equivalence structures, up to isomorphism. We also prove that there exists an effective Friedberg enumeration of all isomorphism types of infinite computable equivalence structures.

Publisher

World Scientific Pub Co Pte Lt

Subject

Logic

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219061317500088

Reference26 articles.

1. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

2. Studies in Logic and the Foundations of Mathematics;Ash C.,2000

3. Abelian groups without elements of finite order

4. Effectively closed sets and enumerations

5. Effective categoricity of equivalence structures

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalization of Shapiro’s theorem to higher arities and noninjective notations;Archive for Mathematical Logic;2022-09-14

2. Enumerating abelian p-groups;Journal of Algebra;2020-10

3. ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES;The Journal of Symbolic Logic;2020-09

4. Classifications of Definable Subsets;Algebra and Logic;2019-11

5. Isomorphism and classification for countable structures;Computability;2019-06-17