The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for...
| 1. Verfasser: | |
|---|---|
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2005
|
| Schlagworte: | Classification Computable Ulm Back-and-forth Mathematics Philosophy Physical sciences |
| Online verfügbar |
Volltext |