Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Fixed-point logic 5 found (13 total)

alternate case: fixed-point logic

Victor Vianu (392 words) [view diff] exact match in snippet view article find links to article

that polynomial time equals PSPACE if and only if fixed-point logic equals partial fixed-point logic. At the 2010 Symposium on Principles of Database Systems
Serge Abiteboul (895 words) [view diff] no match in snippet view article find links to article
polynomial time is equal to PSPACE if and only if fixed point logic is the same as partial fixed point logic. In database theory, he has contributed a wide
Logic of graphs (4,985 words) [view diff] no match in snippet view article find links to article
Several variations of fixed point logics have been studied. In least fixed point logic, the right hand side of the ← {\displaystyle \leftarrow } operator
Dependence logic (4,500 words) [view diff] exact match in snippet view article find links to article
in expressive power to greatest fixed-point logic sentences; hence inclusion logic captures (least) fixed-point logic on finite models, and PTIME over
Guarded logic (812 words) [view diff] no match in snippet view article find links to article
used to denote guarded fragment is GF. Another object is guarded fixed point logic denoted μGF naturally extends guarded fragment from fixed points of