A lattice-theoretical fixpoint theorem and its applications

Cited in

(only showing first 100 items - show all)

The complexity of computing a bisimilarity pseudometric on probabilistic automata
Least and greatest solutions of equations over sets of integers
Existence and approximation of extremal solutions to first-order infinite systems of functional dynamic equations
A trapping principle for discontinuous elliptic systems of mixed monotone type
A complete proof system for propositional projection temporal logic
The fixed-point theory of strictly causal functions
The Mathematical Import of Zermelo's Well-Ordering Theorem
Fuzzy Prolog: A new approach using soft constraints propagation
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
Closures and fairness in the semantics of programming logic
Denotational semantics of an object-oriented programming language with explicit wrappers
Non-local configuration of component interfaces by constraint satisfaction
Stackelberg equilibrium with multiple firms and setup costs
Matching in Hybrid Terminologies
Companions, codensity and causality
Existence and uniqueness of price equilibrium in oligopoly model with power demand
Hidden-Markov program algebra with iteration
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
A note on a Tarski type fixed-point theorem
Thresholded semantic framework for a fully integrated fuzzy logic language
A note on a two-sided discrete-concave market with possibly bounded salaries
GR(1)*: GR(1) specifications extended with existential guarantees
Epistemic logic, monotonicity, and the Halbach-Welch rapprochement strategy
Symbolic model checking of timed guarded commands using difference decision diagrams
Take-it-or-leave-it contracts in many-to-many matching markets
Equational properties of stratified least fixed points (extended abstract)
On a hyperlogistic delay equation
Binary operations and lattice structure for a model of matching with contracts
Infinite random power towers
A decision diagram operation for reachability
Classical (co)recursion: Mechanics
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
Spanning retracts of a partially ordered set
A fixpoint theorem for complete categories
A context dependent equivalence between processes
Fixed point theorems and semantics: A folk tale
Clique divergent clockwork graphs and partial orders
The retracts in P do not form a continuous lattice - a solution to Scott's problem
Coinductive big-step operational semantics
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Don't know for multi-valued systems
A fully abstract denotational semantics for the calculus of higher-order communicating systems
Class invariants as abstract interpretation of trace semantics
On the monotonicity of an optimal choice with respect to a parameter
Fixed Point Theorems for Discontinuous Maps on a Non‐convex Domain
Efficient CTL model-checking for pushdown systems
General quantitative specification theories with modal transition systems
Dynamic programming for non-additive stochastic objectives
A multi attack argumentation framework
A model for synchronous switching circuits and its theory of correctness
Compositional checking of satisfaction
Formal semantics for mutual belief
Objects: a study in Kantian formal epistemology
Fluid limit of generalized Jackson queueing networks with stationary and ergodic arrivals and service times
Foundations of programmology
Reasoning about nondeterministic and concurrent actions: A process algebra approach
Bi-inductive structural semantics
Nondeterministic semantics of compound diagrams
A framework for compositional verification of multi-valued systems via abstraction-refinement
Nash equilibrium uniqueness in nice games with isotone best replies
On modal \(\mu \)-calculus and Gödel-Löb logic
Core of the assignment game via fixed point methods
Invariants for parameterised Boolean equation systems
Parsing as abstract interpretation of grammar semantics
A Relation-Algebraic Treatment of the Dedekind Recursion Theorem
On a generalized iteration method with applications to fixed point theorems and elliptic systems involving discontinuities
K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
Automated image restoration and segmentation using Mumford-Shah-like regularization and topological asymptotic expansion
Uniqueness of equilibrium in a payment system with liquidation costs
Local higher-order fixpoint iteration
Connection between logical and algebraic approaches to concurrent systems
Fixed set theory for closed correspondences with applications to self-similarity and games.
Types and trace effects of higher order programs
How safe are central counterparties in credit default swap markets?
Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
Program schemata technique for propositional program logics: a 30-year history
Latticed \(k\)-induction with an application to probabilistic programs
Reflections on termination of linear loops
Special issue: supermodularity and monotonicity in economics
Viable set computation for hybrid systems
Meanings of model checking
HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
Fixed point theorems for correspondences with values in a partially ordered set and extended supermodular games
A generalization of Naundorf's fixpoint theorem
Qualitative reachability in stochastic BPA games
Process Calculi à la Bird-Meertens
On almost invariant subspaces for implicit linear discrete-time systems
Compositional verification of sequential programs with procedures
The fixed point property for ordered sets
Financial collapse: a lesson from the great depression.
Recursive definitions and fixed-points
On externally complete subsets and common fixed points in partially ordered sets
On sequences of iterations of increasing and continuous mappings on complete lattices
GR(1)*: GR(1) specifications extended with existential guarantees
The Birth of Model Checking
Why not negation by fixpoint?
Fixpoint Theory -- Upside Down
On Small Types in Univalent Foundations
Bisimulation and coinduction enhancements: a historical perspective
Denotational models for programming languages: Applications of Banach's fixed point theorem

This page was built for publication: A lattice-theoretical fixpoint theorem and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2653567)