Strict Superstablity and Decidability of Certain Generic Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911210058809344 |
|---|---|
| author | Valizadeh, Ali N. Pourmahdian, Massoud |
| author_facet | Valizadeh, Ali N. Pourmahdian, Massoud |
| contents | We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ α\inω+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $ α. $ Furthermore, we show that these theories are decidable and pseudofinite. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1903_00272 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Strict Superstablity and Decidability of Certain Generic Graphs Valizadeh, Ali N. Pourmahdian, Massoud Logic Combinatorics 03C99, 05C63 We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ α\inω+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $ α. $ Furthermore, we show that these theories are decidable and pseudofinite. |
| title | Strict Superstablity and Decidability of Certain Generic Graphs |
| topic | Logic Combinatorics 03C99, 05C63 |
| url | https://arxiv.org/abs/1903.00272 |