Search results

In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development...

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

In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator),: p.26  is a higher-order function (i.e. a function which...

First-order logic with a least fixed point operator gives P, the problems solvable in deterministic polynomial time. Existential second-order logic yields...

sentences of first-order logic Lawvere's fixed-point theorem Discrete fixed-point theorems Earle-Hamilton fixed-point theorem Fixed-point combinator, which shows...

fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially ordered set ("poset" for short) to itself is the fixed point...

monadic second-order graph logic allows quantification over sets of vertices or edges. Logics based on least fixed point operators allow more general...

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

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

In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem)...

In mathematics, Lawvere's fixed-point theorem is an important result in category theory. It is a broad abstract generalization of many diagonal arguments...

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

theorems from first-order logic, and are thus less amenable to proof-theoretic analysis. Another type of logics are fixed-point logics that allow inductive...

expressive logics than first-order logic. The 0-1 law has been shown to hold for sentences in FO(LFP), first-order logic augmented with a least fixed point operator...

James Dugundji (2003). Fixed Point Theory. Springer-Verlag, New York. ISBN 978-0-387-00173-9. Forster, T. (2003-07-21). Logic, Induction and Sets. Cambridge...

(1976). Computer scientists grew an interest in the subject of epistemic logic in general – and of common knowledge in particular – starting in the 1980s...

powerful fixed-point extensions to modal style logics. Later Moshe Y. Vardi made a conjecture that a tree model would work for many modal style logics. The...

17–20 are a more formal introduction to combinatory logic, with a special emphasis on fixed point results. Sørensen, Morten Heine B; Urzyczyn, Paweł (2006)...

In mathematical logic, a tautology (from Ancient Greek: ταυτολογία) is a formula that is true regardless of the interpretation of its component terms...