Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4661780 | Annals of Pure and Applied Logic | 2014 | 28 Pages |
Abstract
We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on Ï. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the isomorphism types of some of these partial orders.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan,