BibTeX
@MISC{McColm02guardedquantification,
author = {Gregory McColm},
title = {Guarded Quantification in Least Fixed Point Logic},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop a variant of Least Fixed Point logic based on First Order logic with a relaxed version of guarded quantification. We develop a Game Theoretic Semantics of this logic, and find that under reasonable conditions, guarding quantification does not reduce the expressibility of Least Fixed Point logic. But guarding quantification increases worst-case time complexity.
