Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear ordering on graphs, anti-founded sets and polynomial time computability |
scientific article |
Statements
Linear ordering on graphs, anti-founded sets and polynomial time computability (English)
0 references
12 January 2000
0 references
descriptive complexity
0 references
capturing PTIME
0 references
linear ordering
0 references
strongly extensional graphs
0 references
bisimulation
0 references
anti-foundation axiom
0 references
bounded set theory
0 references
0 references
