Guarded quantification in least fixed point logic (Q1424969)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2057604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guarded quantification in least fixed point logic |
scientific article; zbMATH DE number 2057604 |
Statements
Guarded quantification in least fixed point logic (English)
0 references
15 March 2004
0 references
The author develops a variant of least fixed point logic based on first-order logic with a relaxed version of guarded quantification. He develops a game-theoretic semantics of this logic, and finds that under reasonable conditions, guarding quantification does not reduce the expressibility of least fixed point logic. He also finds that the guarded version of a least fixed point algorithm may have a greater time complexity than the unguarded version, by a linear factor.
0 references
game representations of logics
0 references
game-theoretic semantics
0 references
guarded quantification
0 references
least fixed point logic
0 references
positive elementary induction
0 references
0.91855824
0 references
0.9058843
0 references
0 references
0.89368683
0 references
0.8845743
0 references
0.88368636
0 references
0 references
0.8692211
0 references
