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

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

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

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

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

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

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

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

dependence logic is an extension of that of first-order logic. For a fixed signature σ = (Sfunc, Srel, ar), the set of all well-formed dependence logic formulas...

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 computing, an arithmetic logic unit (ALU) is a combinational digital circuit that performs arithmetic and bitwise operations on integer binary numbers...

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

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

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

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

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

of States and Observations (book draft) Yde Venema: Automata and Fixed Point Logics: a Coalgebraic Perspective. Information and Computation, 204 (2006)...

operations common to many instruction sets include: Set a register to a fixed constant value. Copy data from a memory location or a register to a memory...

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

multimodal logic is the Hennessy–Milner logic, itself a fragment of the more expressive modal μ-calculus, which is also a fixed-point logic. Multimodal logic can...

Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j...

In mathematical logic, a sentence (or closed formula) of a predicate logic is a Boolean-valued well-formed formula with no free variables. A sentence can...

would be tautologies. Note that b is not a fixed point of those constants since b ≠ t and b ≠ f. (2) This logic's ability to contain contradictions applies...

In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic...

In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional...