Undecidability of satisfiability of expansions of \(\mathrm{FO}[<]\) over words with a \(\mathrm{FO}[+]\)-definable set (Q4601030)
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: Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set |
scientific article; zbMATH DE number 6827351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability of satisfiability of expansions of \(\mathrm{FO}[<]\) over words with a \(\mathrm{FO}[+]\)-definable set |
scientific article; zbMATH DE number 6827351 |
Statements
Undecidability of satisfiability of expansions of FO [ < ] over words with a FO [ + ]-definable set (English)
0 references
18 January 2018
0 references
finite model theory
0 references
first-order logic
0 references
arithmetic
0 references
undecidability
0 references
0.7748581767082214
0 references
0.7474952340126038
0 references
0.7456656694412231
0 references
0.7317366600036621
0 references
