Eventual periodicity and ``one-dimensional'' queries (Q1203791): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Gregory Loren McColm / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Gregory Loren McColm / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093636105 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056059644 / rank | |||
Normal rank | |||
Latest revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eventual periodicity and ``one-dimensional'' queries |
scientific article |
Statements
Eventual periodicity and ``one-dimensional'' queries (English)
0 references
22 February 1993
0 references
A generalization of the (finite version of the) Büchi-Ladner representation theorem for monadic second order Boolean queries on chainlike graphs is presented. A careful application of the monotonicity of one-dimensional least fixed point inductions results in the discovery that these inductions express fewer Boolean queries than even the monadic \(\Delta^ 1_ 1\) formulas.
0 references
monadic second order logic
0 references
monadic least fixed point logic
0 references
monadic second order queries
0 references
multigraph
0 references
pebble game
0 references
chainlike graphs
0 references
