Eventual periodicity and ``one-dimensional'' queries (Q1203791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Eventual periodicity and ``one-dimensional queries |
scientific article; zbMATH DE number 120392
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eventual periodicity and ``one-dimensional'' queries |
scientific article; zbMATH DE number 120392 |
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
