Programmological aspects of the fixed point method

DOI10.1007/BF02367760MaRDI QIDQ1905214zbMATH OpenOpenAlexFDO

Authors V. N. Red'ko, D. B. Buj

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

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

Cites work

• scientific article; zbMATH DE number 3884755 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 3653565 (Why is no real title available?)
• scientific article; zbMATH DE number 3755243 (Why is no real title available?)
• scientific article; zbMATH DE number 3784951 (Why is no real title available?)
• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 3635477 (Why is no real title available?)
• scientific article; zbMATH DE number 3372755 (Why is no real title available?)
• A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
• A characterization of complete lattices
• A lattice-theoretical fixpoint theorem and its applications
• Fixed point theorems and semantics: A folk tale

Cited in

(4)

• Computer Aided Verification
• scientific article; zbMATH DE number 3936483 (Why is no real title available?)
• An improved algorithm for the evaluation of fixpoint expressions
• On Tarski’s fixed point theorem

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

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