First-order definability on finite structures (Q1263576): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0168-0072(89)90036-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054510469 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A spectrum hierarchy / rank | |||
Normal rank |
Latest revision as of 11:54, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | First-order definability on finite structures |
scientific article |
Statements
First-order definability on finite structures (English)
0 references
1989
0 references
The author proves an undefinability result for a simple graph-theoretic property. He then shows that existential first-order formulas have a nontrivial hierarchy on finite structures.
0 references
existential hierarchy
0 references
connectedness
0 references
undefinability
0 references
graph-theoretic property
0 references
finite structures
0 references