Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings
| Autor: | Andrea Sorbi, Serikzhan Badaev, Sergey Goncharov |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
arithmetical hierarchy
Discrete mathematics Pure mathematics Mathematics::General Mathematics Arithmetical set Mathematics::General Topology Semilattice Rogers semilattice Arithmetical hierarchy computable numberings elementary theory Distributive property Numberings Elementary theory Arithmetic function computable algebra isomorphism type hyperhypersimple sets Feiner's hierarchy Boolean algebras Mathematics |
| Zdroj: | Computability and Models ISBN: 9781461352259 |
| DOI: | 10.1007/978-1-4615-0755-0_4 |
| Popis: | We investigate differences in isomorphism types and elementary theories of Rogers semilattices of arithmetical numberings, depending on different levels of the arithmetical hierarchy. It is proved that new types of isomorphism appear as the arithmetical level increases. It is also proved the incompleteness of the theory of the class of all Rogers semilattices of any fixed level. Finally, no Rogers semilattice of any infinite family at arithmetical level n ≥ 2 is weakly distributive, whereas Rogers semilattices of finite families are always distributive. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|