A lattice-theoretical fixpoint theorem and its applications
From MaRDI portal
Publication:2653567
DOI10.2140/pjm.1955.5.285zbMath0064.26004OpenAlexW2046213250WikidataQ106090689 ScholiaQ106090689MaRDI QIDQ2653567
Publication date: 1955
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1955.5.285
Related Items (only showing first 100 items - show all)
Estimation of quantity games in the presence of indivisibilities and heterogeneous firms ⋮ Bounded situation calculus action theories ⋮ Computing kernels in directed bichromatic graphs ⋮ Some coincidence theorems for generalized nonlinear contractions in ordered metric spaces with applications ⋮ Inductive properties of fixed point sets of mappings on posets and on partially ordered topological spaces ⋮ A fixed point iterative approach to integer programming and its distributed computation ⋮ Weakest preconditions for pure Prolog programs ⋮ Structural estimation of pairwise stable networks with nonnegative externality ⋮ On externally complete subsets and common fixed points in partially ordered sets ⋮ Towards the hierarchical verification of reactive systems ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Fuzzy Prolog: A new approach using soft constraints propagation ⋮ Markov stationary equilibria in stochastic supermodular games with imperfect private and public information ⋮ Control of \((max, +)\)-linear systems minimizing delays ⋮ Reflexive transitive invariant relations: A basis for computing loop functions ⋮ An order-centric treatment of the Bayesian supermodular game ⋮ Common fixed point and coincidence point of generalized contractions in ordered metric spaces ⋮ Extremal solutions for certain type of fractional differential equations with maxima ⋮ The contraction principle for set valued mappings on a metric space with a graph ⋮ A complete proof system for propositional projection temporal logic ⋮ Best proximity points: approximation and optimization in partially ordered metric spaces ⋮ Monotone comparative statics for games with strategic substitutes ⋮ Efficient CTL model-checking for pushdown systems ⋮ General quantitative specification theories with modal transition systems ⋮ Mathematical programming: Turing completeness and applications to software analysis ⋮ Information percolation in segmented markets ⋮ Subsets of the square with the continuous and order preserving fixed point property ⋮ The existence of the attractor of countable iterated function systems ⋮ Well-founded semantics for defeasible logic ⋮ Multi-valued model checking games ⋮ On the failure of fixed-point theorems for chain-complete lattices in the effective topos ⋮ Data model descriptions and translation signatures in a multi-model framework ⋮ Solving discrete systems of nonlinear equations ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Sequential and distributed on-the-fly computation of weak tau-confluence ⋮ Completeness for flat modal fixpoint logics ⋮ Semantics of structured normal logic programs ⋮ Decentralized control of infinite systems ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ Constructive Boolean circuits and the exactness of timed ternary simulation ⋮ Sahlqvist correspondence for modal mu-calculus ⋮ On behavioural pseudometrics and closure ordinals ⋮ On possible generalization of fuzzy concept lattices using dually isomorphic retracts ⋮ Relatively terminal coalgebras ⋮ Network effects, market structure and industry performance ⋮ Recursive definitions and fixed-points on well-founded structures ⋮ Complementarity with complete but \(P\)-acyclic preferences ⋮ Magic-sets for localised analysis of Java bytecode ⋮ Free entry versus socially optimal entry ⋮ Lattice-valued simulations for quantitative transition systems ⋮ Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes ⋮ Fixed point theorems for set valued mappings in partially ordered \(G\)-metric space ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Iterative belief revision in extended logic programming ⋮ Probabilistic communicating processes ⋮ Extremal solutions of inequations over lattices with applications to supervisory control ⋮ Monotonic aggregation in deductive databases ⋮ Reusing and modifying rulebases by predicate substitution ⋮ Spatial logic of tangled closure operators and modal mu-calculus ⋮ Cycles in public opinion and the dynamics of stable party systems ⋮ Compositional checking of satisfaction ⋮ A model for synchronous switching circuits and its theory of correctness ⋮ Proof methods of declarative properties of definite programs ⋮ Formal semantics for mutual belief ⋮ The PT-order and the fixed point property ⋮ On the reduction of \(LR(k)\) parsers ⋮ Reverse mathematics and order theoretic fixed point theorems ⋮ Objects: a study in Kantian formal epistemology ⋮ Fuzzy logic programming reduced to reasoning with attribute implications ⋮ Core of the assignment game via fixed point methods ⋮ Dual choice and iteration in an abstract algebra of action ⋮ Zone diagrams in Euclidean spaces and in other normed spaces ⋮ Symbolic extensions and continuity properties of the entropy ⋮ CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks ⋮ A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus ⋮ Fixing Zeno gaps ⋮ Best response dynamics in finite games with additive aggregation ⋮ Local adjustments: A general algorithm ⋮ Automata-based axiom pinpointing ⋮ An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus ⋮ Stochastic game logic ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ Qualitative reachability in stochastic BPA games ⋮ An intensional characterization of the largest bisimulation ⋮ Frame rule for mutually recursive procedures manipulating pointers ⋮ A single-sorted theory of multisets ⋮ A note on fixed point results without monotone property in partially ordered metric space ⋮ Novshek's trick as a polynomial algorithm ⋮ Implicit linear discrete-time systems ⋮ Negation in rule-based database languages: A survey ⋮ Game-theoretic simulation checking tool ⋮ Aggregated fuzzy answer set programming ⋮ Eine Verschärfung des Bernsteinschen Äquivalenzsatzes ⋮ Abstract measure differential inequalities and applications ⋮ Paradox, truth and logic. I. Paradox and truth ⋮ Closures and fairness in the semantics of programming logic ⋮ Nondeterministic semantics of compound diagrams ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement
This page was built for publication: A lattice-theoretical fixpoint theorem and its applications
