The Complexity of Infinite Computations In Models of Set Theory (Q3401139): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0910.1268 / rank | |||
Normal rank | |||
Latest revision as of 15:24, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Infinite Computations In Models of Set Theory |
scientific article |
Statements
The Complexity of Infinite Computations In Models of Set Theory (English)
0 references
28 January 2010
0 references
infinite words
0 references
\(\omega \)-languages
0 references
1-counter automaton
0 references
2-tape automaton
0 references
two-dimensional words
0 references
tiling systems
0 references
Cantor topology
0 references
topological complexity
0 references
Borel sets
0 references
effective coanalytic set
0 references
models of set theory
0 references
independence from ZFC
0 references
