A lattice-theoretical fixpoint theorem and its applications
From MaRDI portal
Publication:2653567
DOI10.2140/PJM.1955.5.285zbMATH Open0064.26004OpenAlexW2046213250WikidataQ106090689 ScholiaQ106090689MaRDI QIDQ2653567FDOQ2653567
Authors: Alfred Tarski
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
Cited In (only showing first 100 items - show all)
- A complete proof system for propositional projection temporal logic
- Equational properties of stratified least fixed points (extended abstract)
- Efficient CTL model-checking for pushdown systems
- General quantitative specification theories with modal transition systems
- A generalization of Naundorf's fixpoint theorem
- Compositional verification of sequential programs with procedures
- Qualitative reachability in stochastic BPA games
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- 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
- A fixed point theorem for non-monotonic functions
- Order-preserving self-maps of complete lattices
- Multi-valued model checking games
- On the failure of fixed-point theorems for chain-complete lattices in the effective topos
- Sahlqvist correspondence for modal mu-calculus
- Reprint of: ``Information percolation in segmented markets
- Completeness for flat modal fixpoint logics
- Data model descriptions and translation signatures in a multi-model framework
- Program derivation with verified transformations — a case study
- Generalized \(F\)-contractions in partially ordered metric spaces
- Complementarity with complete but \(P\)-acyclic preferences
- Completions of \(\mu \)-algebras
- 3-valued abstraction: More precision at less cost
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Sequential and distributed on-the-fly computation of weak tau-confluence
- Best response dynamics in finite games with additive aggregation
- Concurrent secrets
- Title not available (Why is that?)
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Least and Greatest Fixpoints in Game Semantics
- Semantics of structured normal logic programs
- Unique solutions for stochastic recursive utilities
- Fixed point characterization of infinite behavior of finite-state systems
- Analyzing probabilistic pushdown automata
- On fuzzification of some concepts of graphs
- Nonlinear Leontief models in abstract spaces
- Operational semantics of Framed Tempura
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Concept lattices defined from implication operators
- Symbolic transition graph with assignment
- Model checking and boolean graphs
- Mathematics for reasoning about loop functions
- Rooted branching bisimulation as a congruence
- Mathematical modal logic: A view of its evolution
- Coupled common fixed point theorems for a pair of commuting mappings in partially ordered G-metric spaces
- Fixed point theorems and their applications to theory of Nash equilibria
- A fixed point theorem for finite partially orderes sets
- Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition
- The power of reachability testing for timed automata
- Network effects, market structure and industry performance
- Static analysis by abstract interpretation: a mathematical programming approach
- Syntax and semantics of multi-adjoint normal logic programming
- Control of \((max, +)\)-linear systems minimizing delays
- Mathematical programming based debugging
- On strategic complementarities in discontinuous games with totally ordered strategies
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Complexity of propositional projection temporal logic with star
- The existence of the attractor of countable iterated function systems
- On various eigen fuzzy sets and their application to image reconstruction
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- Negation in rule-based database languages: A survey
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Model-checking for real-time systems
- Probabilistic communicating processes
- Abstract fixpoint computations with numerical acceleration methods
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
- On \(*\)-\(\lambda\)-semirings.
- An order-centric treatment of the Bayesian supermodular game
- Fixed point theorems for \(\tau -\varphi \)-concave operators and applications
- Fixed points in partially ordered sets
- Fixpoint semantics for logic programming a survey
- Bilattices and the theory of truth
- Just in time control of constrained \((max,+)\)-linear systems
- Extremal solutions for certain type of fractional differential equations with maxima
- Fixed point theorems for discounted finite Markov decision processes
- Relation-algebraic computation of fixed points with applications
- A search model of two-sided matching under nontransferable utility.
- A fully abstract denotational semantics for the calculus of higher-order communicating systems
- Closures and fairness in the semantics of programming logic
- Spanning retracts of a partially ordered set
- Fixed point theorems and semantics: A folk tale
- Class invariants as abstract interpretation of trace semantics
- A multi attack argumentation framework
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- On a generalized iteration method with applications to fixed point theorems and elliptic systems involving discontinuities
- 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
- Recursive definitions and fixed-points
- Bi-inductive structural semantics
- Parsing as abstract interpretation of grammar semantics
- The fixed point property for ordered sets
- On almost invariant subspaces for implicit linear discrete-time systems
- Why not negation by fixpoint?
- Infinitary logics and 0-1 laws
- The powerset algebra as a natural tool to handle nested database relations
- The convergence of functions to fixedpoints of recursive definitions
- Nondeterminacy and recursion via stacks and games
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)