Results 11 to 20 of about 86 (78)
TARSKI’S FIXED POINT THEOREM IN DEDEKIND CATEGORIES [PDF]
TARSKI’S FIXED POINT THEOREM IN DEDEKIND CATEGORIESTarski's fixed point theorem for complete lattices is a fundamental theorem in lattice theory and is very useful for computer science applications. This paper will show a general result in Dedekind categories, which extends the Tarski's theorem.
Honda, Kazumasa +3 more
openaire +1 more source
Tarski's least fixed point theorem: A predicative type theoretic formulation [PDF]
We provide a type theoretic treatment of the paper "On Tarski's fixed point theorem" by Giovanni Curi. There are benefits to having a type theoretic formulation apart from routine implementation in a proof assistant. By taking advantage of (higher) inductive types, we can avoid complicated set theoretic constructions.
Ray, Ian
openaire +3 more sources
A Unifying Framework for Submodular Mean Field Games [PDF]
, 2022 Dianetti J, Ferrari G, Fischer M, Nendel M. A Unifying Framework for Submodular Mean Field Games. Center for Mathematical Economics Working Papers. Vol 661.
Ferrari, Giorgio +7 more
core +1 more source
Core of the assignment game via fixed point methods [PDF]
, 2011 This paper shows that the core outcomes of the assignment game coincides with the set of fixed points of a certain function. The lattice property of the core, as well as its non-emptiness, are proved using Tarski's fixed point ...
Serkan Kucuksenel +1 more
core +1 more source
Fuzzy sets (in)equations with a complete codomain lattice [PDF]
, 2022 summary:The paper applies some properties of the monotonous operators on the complete lattices to problems of the existence and the construction of the solutions to some fuzzy relational equations, inequations, and their systems, taking a complete ...
Stepanović, Vanja +1 more
core +1 more source
A lattice-theoretic approach to a class of dynamic games [PDF]
, 1989 We consider a general class of dynamic games arising in strategic capital accumulation/resource extraction, and show that they have Nash equilibria in pure stationary strategies.The approach is new and relies on Topkis' results in lattice programming and
R. AMIR, Amir, R.
core +1 more source
The equilibrium set of two-player games with complementarities is a sublattice [PDF]
, 2003 I prove that the equilibrium set in a two-player game with complementarities, and totally ordered strategy spaces, is a sublattice of the joint strategy space.
Echenique, Federico, Federico Echenique
core +1 more source
, 2010 We propose a method to characterize the fixed points described in Tarski's theorem for complete lattices. The method is deductive: the least and greatest fixed points are "proved" in some inference system defined from deduction rules.
Herve ́ Grall, Grall, Hervé
core +2 more sources
Extending the Calculus of Constructions with Tarski's fix-point theorem
CoRR, 2006 We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to potentially non-terminating functions.
openaire +4 more sources
Weak, Strong and Mixed Extensions of Relations to Spaces of Ultrafilters
Mathematical Logic Quarterly, Volume 72, Issue 3, August 2026.ABSTRACT The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers, focused mostly on congruences and divisions. We show that similar methods can be used to extend these characterizations to arbitrary relations and their interplay.
Leonardo Raffaello Maximilian Gasparro +1 more
wiley +1 more source