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...

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

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

fixed-point free. The fixed-point theorem shows that no total computable function is fixed-point free, but there are many non-computable fixed-point-free...

In computing, fixed-point is a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar...

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...

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 mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued...

least fixed point operators allow more general predicates over tuples of vertices, but these predicates can only be constructed through fixed-point operators...

Fixed-point computation refers to the process of computing an exact or approximate fixed point of a given function. In its most common form, the given...

suitable least fixed-point combinator. Recursive functions can be defined with this and the order relation. As long as the signature contains at least one...

many modalities) by adding the least fixed point operator μ and the greatest fixed point operator ν, thus a fixed-point logic. The (propositional, modal)...

ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one[clarification...

or do-nothing command. There is no need for a loop invariant or least fixed point. Loops with multiple intermediate shallow and deep exits work the...

steps 2 and 3 until all Fi sets stay the same. The result is the least fixed point solution to the following system: Fi(A) ⊇ Fi(w) for each rule A →...

the rules of the program in a single step. The least-fixed-point semantics define the least fixed point of T to be the meaning of the program; this coincides...

The method of least squares is a parameter estimation method in regression analysis based on minimizing the sum of the squares of the residuals (a residual...

order-preserving self-map f of a pointed dcpo (P, ⊥) has a least fixed-point. If f is continuous then this fixed-point is equal to the supremum of the iterates (⊥,...

is a branch of mathematical research with its origins in topological fixed-point theory. Its central ideas were developed by Danish mathematician Jakob...

isometries of K {\displaystyle K} has at least one fixed point. (Here, a fixed point of a set of maps is a point that is fixed by each map in the set.) This theorem...

progressions of abstract states are replaced by a (computed or guessed) least fixed point. The use of the term in model checking is closely related to acceleration...

inductive subset of a Polish space) is one that can be defined as the least fixed point of a monotone operation definable by a positive Σ1n formula, for some...

recursive types that zippers are formed from can be viewed as the least fixed point of a unary type constructor of kind ∗ → ∗ {\displaystyle *\rightarrow...

both fixed and variable costs to the company. Total profit at the break-even point is zero. It is only possible for a firm to pass the break-even point if...

In computing, floating-point arithmetic (FP) is arithmetic that represents subsets of real numbers using an integer with a fixed precision, called the...