Results 61 to 70 of about 86 (78)

Metric domains for completeness [PDF]

Completeness is a semantic non-operational notion of program correctness suggested (but not pursued) by W.W.Wadge. Program verification can be simplified using completeness, firstly by removing the approximation relation from proofs, and secondly by ...
Matthews, Stephen G.
core  

Intelligently deciphering unintelligible designs: algorithmic algebraic model checking in systems biology. [PDF]

J R Soc Interface, 2009
Mishra B.
europepmc   +1 more source

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

An Approach to Housing Markets with Externalities using Tarski's Fixed-Point Theorem
This paper presents a model of rental housing markets with externalities, in which households and landlords trade apartments as indivisible commodities. The externalities among households are considered in such a way that the average income of households affects on a household's consumption behavior.
openaire  

An Existence Theorem for a Parabolic Differential Equation in l∞{A) Based on the Tarski Fixed Point Theorem

Demonstratio Mathematica, 1997
openaire   +1 more source

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

, 2017
池田, 潔, Kiyoshi, Ikeda
core  

On fuzzification of Tarski's fixed point theorem without transitivity [PDF]

Fuzzy Sets and Systems, 2017
The paper presents a fuzzification of Tarski's fixed point theorem in the same form as in the original article of \textit{A. Tarski} [Pac. J. Math. 5, 285--309 (1955; Zbl 0064.26004)].
Frantisek Vcelar, Zuzana Pátíková
core   +5 more sources

A comparative study of Tarski's fixed point theorems with the stress on commutative sets of L-fuzzy isotone maps with respect to transitivities [PDF]

Fuzzy Sets and Systems, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frantisek Vcelar, Zuzana Pátíková
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

A companion preorder to G-majorization and a Tarski type fixed-point theorem section: convex analysis

Journal of Fixed Point Theory and Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices

Order, 1989
A poset is u-conditionally complete if a subset has a least upper bound whenever all its subsets of cardinality less than u have upper bounds. The authors prove that for these posets the set of fixed point sets of monotonic functions coincides with the set of its retracts, which can be described as those u-conditionally complete subposets which are ...
Berman, Joel, Blok, W. J.
openaire   +1 more source