How complex are random graphs in first order logic? (Q4667860): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q590239 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: J. H. Spencer / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2952496718 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0401247 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The strange logic of random graphs / rank | |||
Normal rank | |||
Latest revision as of 09:15, 10 June 2024
scientific article; zbMATH DE number 2159950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How complex are random graphs in first order logic? |
scientific article; zbMATH DE number 2159950 |
Statements
How complex are random graphs in first order logic? (English)
0 references
21 April 2005
0 references
first order complexity
0 references
random graphs
0 references
