Journal of Logic, Language and Information 13 (1):61-110 (2004)
We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.
|Keywords||game representations of logics game theoretic semantics guarded quantification least fixed point logic positive elementary induction|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
The Expressive Power of Fixed-Point Logic with Counting.Martin Otto - 1996 - Journal of Symbolic Logic 61 (1):147-176.
Loosely Guarded Fragment of First-Order Logic has the Finite Model Property.Ian Hodkinson - 2002 - Studia Logica 70 (2):205 - 240.
Comparing Fixed-Point and Revision Theories of Truth.Philip Kremer - 2009 - Journal of Philosophical Logic 38 (4):363-403.
The Semijoin Algebra and the Guarded Fragment.Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz & Jan Van den Bussche - 2005 - Journal of Logic, Language and Information 14 (3):331-343.
Guards, Bounds, and Generalized Semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Added to index2009-01-28
Total downloads4 ( #645,265 of 2,171,999 )
Recent downloads (6 months)1 ( #325,967 of 2,171,999 )
How can I increase my downloads?