Complexity of the first-order theory of almost all finite structures (Q3329449)
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 3861132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the first-order theory of almost all finite structures |
scientific article; zbMATH DE number 3861132 |
Statements
Complexity of the first-order theory of almost all finite structures (English)
0 references
1983
0 references
zero-one law for graphs
0 references
Turing machine
0 references
first-order sentence
0 references
relational type
0 references
true almost everywhere
0 references
PSPACE-complete
0 references
theory of almost all directed graphs
0 references
0.8226890563964844
0 references
0.7783746719360352
0 references
0.7742509841918945
0 references
0.7628836035728455
0 references
