Guarded quantification in least fixed point logic (Q1424969): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1026107209351 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1487926359 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guarded quantification in least fixed point logic |
scientific article |
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
