Results 71 to 78 of about 86 (78)

Tarski's Fixed-Point Theorem And Lambda Calculi With Monotone Inductive Types

Synthese, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Tarski’s Fixed-Point Theorem and CBT

2012
In Tarski’s 1955 paper on the lattice theoretical Fixed-Point Theorem, several proofs of CBT are included, for sets, for homogeneous elements of a Boolean algebra and for Boolean algebras. We present these proofs in detail.
openaire   +1 more source

The knaster-tarski fixed-point theorem is not uniformly constructive

International Journal of Computer Mathematics, 1987
Kleene's fixed-point theorem holds uniformly constructive (see [1]). On this basis, a fixed-point theory was developed for the semantics of recursive programs. However, there exist fixed-point theorems which fail to hold uniformly constructive, e.g. the computable transformation (induced by an integral) having no computable fixed-point ([2]).
openaire   +1 more source

Fixed point theorems in metric and uniform spaces via the Knaster-Tarski Principle

Nonlinear Analysis: Theory, Methods & Applications, 1998
The proofs of many fixed point theorems in metric partially ordered sets are based on Bourbaki-Kneser and Knaster-Tarski principles. The author emphasizes that both these theorems are independent of the axiom of choice and notices that proofs of them are almost immediate, if one uses Zorn's lemma.
openaire   +2 more sources

An extension of Tarski's fixed point theorem and its application to isotone complementarity problems

Mathematical Programming, 1984
Tarski's fixed point theorem is extended to the case of set-valued mappings, and is applied to a class of complementarity problems defined by isotone set-valued operators in a complete vector lattice.
openaire   +2 more sources

SOME CONSEQUENCES OF THE TARSKI-KANTOROVITCH ORDERING THEOREM IN METRIC FIXED POINT THEORY

Quaestiones Mathematicae, 1998
Abstract We show that the Tarski-Kantorovitch Principle for continuous maps on a partially ordered set yields some fixed point theorems for contractive maps on a uniform space. Our proofs do not depend on the Axiom of Choice.
openaire   +1 more source

Some issues concerning fixed points in computational logic: Quasi-metrics, multivalued mappings and the Knaster-Tarski theorem [PDF]

, 1999
Summary: Many questions concerning the semantics of disjunctive databases and of logic programming systems depend on the fixed points of various multivalued mappings and operators determined by the database or program. We discuss known versions, for multivalued mappings, of the Knaster-Tarski theorem and of the Banach contraction mapping theorem, and ...
Hitzler, Pascal, Seda, Anthony K.
openaire   +1 more source

An Approach to Housing Markets with Externalities using Tarski's Fixed-Point Theorem

研究紀要 = Bulletin of Tsukuba International University, 2005
openaire   +1 more source