\(\mathrm{FO}^2\) with one transitive relation is decidable (Q2957894)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6678930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\mathrm{FO}^2\) with one transitive relation is decidable |
scientific article; zbMATH DE number 6678930 |
Statements
30 January 2017
0 references
classical decision problem
0 references
two-variable first-order logic
0 references
decidability
0 references
computational complexity
0 references
0.9101789593696594
0 references
0.8718955516815186
0 references
0.8253616094589233
0 references
0.815048336982727
0 references
0.806674063205719
0 references
