A Fixed Point Theorem on Lexicographic Lattice Structures
DOI10.1145/3373718.3394797zbMATH Open1498.06009OpenAlexW3031008428MaRDI QIDQ5145643FDOQ5145643
Authors: Angelos Charalambidis, Giannos Chatziagapis, Panos Rondogiannis 
Publication date: 21 January 2021
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3373718.3394797
Recommendations
- A fixed point theorem with applications to truncated lattices
- Fixed points and complete lattices
- scientific article; zbMATH DE number 4048468
- \(T\)-lattices and fixed point theory
- Lefschetz fixed-point theorem and lattice points in convex polytope
- The strong fixed point property for lexicographic sums
- scientific article; zbMATH DE number 4034487
- Takahashi's and Fan-Browder's fixed point theorems in a vector lattice
- Fixed points of inequality-preserving maps in complete lattices
- scientific article; zbMATH DE number 4106917
Structure theory of lattices (06B05) Complete lattices, completions (06B23) Logical aspects of lattices and related structures (03G10)
Cited In (6)
- Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars
- Equational properties of stratified least fixed points (extended abstract)
- The strong fixed point property for lexicographic sums
- A fixed point theorem for non-monotonic functions
- Domain theory for nonmonotonic functions
- Title not available (Why is that?)
This page was built for publication: A Fixed Point Theorem on Lexicographic Lattice Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145643)
