Programmological aspects of the fixed point method

DOI10.1007/BF02367760zbMath0837.68063OpenAlexW1989053949MaRDI QIDQ1905214

V. N. Red'ko, D. B. Buy

Publication date: 16 April 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02367760

zbMATH Keywords

fix point set

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Cites Work

• Fixed point theorems and semantics: A folk tale
• A lattice-theoretical fixpoint theorem and its applications
• A characterization of complete lattices
• A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programmological aspects of the fixed point method