Incompleteness theorems, large cardinals, and automata over infinite words (Q3449478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Incompleteness theorems, large cardinals, and automata over infinite words |
scientific article; zbMATH DE number 6504593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incompleteness theorems, large cardinals, and automata over infinite words |
scientific article; zbMATH DE number 6504593 |
Statements
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (English)
0 references
4 November 2015
0 references
automata and formal languages
0 references
logic in computer science
0 references
infinite words
0 references
1-counter Büchi automaton
0 references
2-tape Büchi automaton
0 references
models of set theory
0 references
incompleteness theorems
0 references
large cardinals
0 references
inaccessible cardinals
0 references
independence from the axiomatic system
0 references
``\(\mathbf{ZFC}\) + there exist \(n\) inaccessible cardinals''
0 references
0.9111949801445008
0 references
0.9100675582885742
0 references
0.8593637943267822
0 references
0.842327892780304
0 references
0.7782307863235474
0 references
