Isomorphisms and Algorithmic Properties of Structures with Two Equivalences
Isomorphisms and algorithmic properties of structures with two equivalences are considered using definability methods (developed by the author) for a graph in a bipartite graph and in a structure with two equivalences, which respect algorithmic and syntactic properties of the original structure.
Gespeichert in:
Veröffentlicht in: | Algebra and logic 2016-03, Vol.55 (1), p.50-57 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Isomorphisms and algorithmic properties of structures with two equivalences are considered using definability methods (developed by the author) for a graph in a bipartite graph and in a structure with two equivalences, which respect algorithmic and syntactic properties of the original structure. |
---|---|
ISSN: | 0002-5232 1573-8302 |
DOI: | 10.1007/s10469-016-9375-8 |