Results 61 to 70 of about 330,018 (78)
Some of the next articles are maybe not open access.
A note on the Knaster–Tarski Fixpoint Theorem
Algebra Universalis, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuxi Fu, Mengqiao Huang
exaly +3 more sources
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.
core +4 more sources
Fixed point theorems in metric and uniform spaces via the Knaster-Tarski Principle
Nonlinear Analysis: Theory, Methods & Applications, 1998The 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.
Jacek Jachymski
exaly +3 more sources
The knaster-tarski fixed-point theorem is not uniformly constructive
International Journal of Computer Mathematics, 1987Kleene'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]).
exaly +2 more sources
A fixed point theorem equivalent to the Fan-Knaster-Kuratowski-Mazurkiewicz theorem [PDF]
Journal of Mathematical Analysis and Applications, 1987 In this note we prove a fixed point theorem and show that this fixed point theorem is equivalent to a recent generalization of the Knaster-Kuratowski-Mazurkiewicz theorem by Ky ...
E Tarafdar
exaly +2 more sources
The complexity of Tarski’s fixed point theorem [PDF]
Theoretical Computer Science, 2008 Tarski’s fixed point theorem guarantees the existence of a fixed point of an order-preserving function f:L→L defined on a nonempty complete lattice (L,⪯) [B.
Yuh-Dauh Lyuu
exaly +2 more sources
The Tarski irredundant basis theorem and the finite soluble groups
Mathematische Nachrichten, 2019 Denote by d=d(G) and m=m(G), respectively, the smallest and the largest cardinality of a minimal generating set of a finite group G. The Tarski irredundant basis theorem implies that for every k with d(G)
Andrea Lucchini, Mariapia Moscatiello
exaly +2 more sources
A note on a Tarski type fixed-point theorem
International Journal of Game Theory, 2021Roberto Ghiselli Ricci
exaly