Results 1 
2 of
2
Guarded Quantification in Least Fixed Point Logic
, 2002
"... 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 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
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 worstcase time complexity.
A Characterization of FirstOrder Definable Subsets on Classes of Finite Total Orders
, 1993
"... We give an explicit and easytoverify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a firstorder formula. ..."
Abstract
 Add to MetaCart
(Show Context)
We give an explicit and easytoverify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a firstorder formula.