order theory, a branch of mathematics, the least fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially ordered set...

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some...

In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation...

relationship to database query languages, in particular to Datalog. Least fixed-point logic was first studied systematically by Yiannis N. Moschovakis in...

guarantees the existence of at least one fixed point of f, and even the existence of a least fixed point (or greatest fixed point). In many practical cases...

{\displaystyle {\textrm {lfp}}} denotes the least fixed point. Although Tarski's fixed point theorem does not consider how fixed points can be computed by iterating...

solvable in nondeterministic logarithmic space. First-order logic with a least fixed point operator gives P, the problems solvable in deterministic polynomial...

In mathematics, the Lefschetz fixed-point theorem is a formula that counts the fixed points of a continuous mapping from a compact topological space X...

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function f {\displaystyle...

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function f...