Pages that link to "Item:Q2653567"
From MaRDI portal
The following pages link to A lattice-theoretical fixpoint theorem and its applications (Q2653567):
Displaying 50 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- Estimation of quantity games in the presence of indivisibilities and heterogeneous firms (Q278049) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- Computing kernels in directed bichromatic graphs (Q287022) (← links)
- Some coincidence theorems for generalized nonlinear contractions in ordered metric spaces with applications (Q287922) (← links)
- Inductive properties of fixed point sets of mappings on posets and on partially ordered topological spaces (Q288145) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- Structural estimation of pairwise stable networks with nonnegative externality (Q337778) (← links)
- On externally complete subsets and common fixed points in partially ordered sets (Q359962) (← links)
- Markov stationary equilibria in stochastic supermodular games with imperfect private and public information (Q367430) (← links)
- Control of \((max, +)\)-linear systems minimizing delays (Q373011) (← links)
- An order-centric treatment of the Bayesian supermodular game (Q378757) (← links)
- Common fixed point and coincidence point of generalized contractions in ordered metric spaces (Q383879) (← links)
- Extremal solutions for certain type of fractional differential equations with maxima (Q387301) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- Best proximity points: approximation and optimization in partially ordered metric spaces (Q395859) (← links)
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Information percolation in segmented markets (Q406369) (← links)
- Subsets of the square with the continuous and order preserving fixed point property (Q412733) (← links)
- The existence of the attractor of countable iterated function systems (Q414385) (← links)
- Multi-valued model checking games (Q414899) (← links)
- On the failure of fixed-point theorems for chain-complete lattices in the effective topos (Q418812) (← links)
- Data model descriptions and translation signatures in a multi-model framework (Q429441) (← links)
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Sequential and distributed on-the-fly computation of weak tau-confluence (Q436408) (← links)
- Semantics of structured normal logic programs (Q444364) (← links)
- Constructive Boolean circuits and the exactness of timed ternary simulation (Q453539) (← links)
- Sahlqvist correspondence for modal mu-calculus (Q454371) (← links)
- On behavioural pseudometrics and closure ordinals (Q456100) (← links)
- On possible generalization of fuzzy concept lattices using dually isomorphic retracts (Q456459) (← links)
- Relatively terminal coalgebras (Q456862) (← links)
- Free entry versus socially optimal entry (Q472183) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Fixed point theorems for set valued mappings in partially ordered \(G\)-metric space (Q482648) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Spatial logic of tangled closure operators and modal mu-calculus (Q515566) (← links)
- Cycles in public opinion and the dynamics of stable party systems (Q517009) (← links)
- Reverse mathematics and order theoretic fixed point theorems (Q527337) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- Core of the assignment game via fixed point methods (Q533916) (← links)
- Symbolic extensions and continuity properties of the entropy (Q539998) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus (Q557788) (← links)
