Reducibilities among equivalence relations induced by recursively enumerable structures

About this item

Title

Reducibilities among equivalence relations induced by recursively enumerable structures

Content partner

University of Otago

Collection

Otago University Research Archive

Description

In this paper we investigate the dependence of recursively enumerable structures on the equality relation which is fixed to a specific r.e. equivalence relation. We compare r.e. equivalence relations on the natural numbers with respect to the amount of structures they permit to represent from a given class of structures such as algebras, permutations and linear orders. In particular, we show that for various types of structures represented, there are minimal and maximal elements. (C) 2015 Els...

Read more

Format

Research paper

Research format

Scholarly text / Journal article

Thesis level

Article

Date created

2016-01-25

Creator

Gavryushkin, Alex / Khoussainov, Bakhadyr / Stephan, Frank

URL

https://hdl.handle.net/10523/29087

Related subjects

Computer Science / Computer Science, Theory & Methods / Science & Technology / Technology

What is the copyright status of this item?

All Rights Reserved

This item is all rights reserved, which means you'll have to get permission from University of Otago before using it.

What can I do with this item?

You must always check with University of Otago to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

No sharing

You may not copy and/or share this item with others without further permission. This includes posting it on your blog, using it in a presentation, or any other public use.

No modifying

You are not allowed to adapt or remix this item into any other works.

No commercial use

You may not use this item commercially.