Incompleteness Theorems, Large Cardinals, and Automata over Finite Words (Q2988824)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incompleteness Theorems, Large Cardinals, and Automata over Finite Words |
scientific article |
Statements
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words (English)
0 references
19 May 2017
0 references
automata and formal languages
0 references
logic in computer science
0 references
finite words
0 references
context-free grammars
0 references
2-tape automaton
0 references
post correspondence problem
0 references
weighted automaton
0 references
finitely generated matrix subsemigroups of \(\mathbb {Z}^{3\times 3}\)
0 references
models of set theory
0 references
incompleteness theorems
0 references
large cardinals
0 references
inaccessible cardinals
0 references
independence
0 references
Peano arithmetic
0 references
0 references
0 references
