Pages that link to "Item:Q2653567"
From MaRDI portal
The following pages link to A lattice-theoretical fixpoint theorem and its applications (Q2653567):
Displayed 50 items.
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus (Q557788) (← links)
- An intensional characterization of the largest bisimulation (Q580963) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Fuzzy Prolog: A new approach using soft constraints propagation (Q598583) (← links)
- Iterative belief revision in extended logic programming (Q672058) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- Extremal solutions of inequations over lattices with applications to supervisory control (Q672379) (← links)
- Monotonic aggregation in deductive databases (Q676422) (← links)
- Reusing and modifying rulebases by predicate substitution (Q676430) (← links)
- Compositional checking of satisfaction (Q685107) (← links)
- A model for synchronous switching circuits and its theory of correctness (Q685112) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Formal semantics for mutual belief (Q685541) (← links)
- The PT-order and the fixed point property (Q687171) (← links)
- On the reduction of \(LR(k)\) parsers (Q688231) (← links)
- Best response dynamics in finite games with additive aggregation (Q705947) (← links)
- Local adjustments: A general algorithm (Q707084) (← links)
- Implicit linear discrete-time systems (Q752642) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Eine Verschärfung des Bernsteinschen Äquivalenzsatzes (Q771178) (← links)
- Abstract measure differential inequalities and applications (Q791736) (← links)
- Paradox, truth and logic. I. Paradox and truth (Q798312) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Least reflexive points of relations (Q815002) (← links)
- An NSF proposal (Q815007) (← links)
- What truth depends on (Q815014) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
- Relation-algebraic computation of fixed points with applications (Q817578) (← links)
- Interpretability of first-order linear temporal logics in fork algebras (Q817582) (← links)
- Binary resolution over Boolean lattices (Q853473) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- A formal mathematical framework for modeling probabilistic hybrid systems (Q870808) (← links)
- On extremal pure Nash equilibria for mixed extensions of normal-form games (Q875272) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Existence and comparison results for fixed points of multifunctions with applications to normal-form games (Q882013) (← links)
- Just in time control of constrained \((max,+)\)-linear systems (Q884764) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)
- Nonlinear operators in Euclidean spaces: An elementary `users guide' for economists (Q911978) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Nash equilibrium with strategic complementarities (Q920858) (← links)
- A fixed point theorem for discontinuous functions (Q924894) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- The complexity of Tarski's fixed point theorem (Q935168) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)