A Proof of Tarski’s Fixed Point Theorem by Application of Galois Connections

Studia Logica 103 (2):287-301 (2015)
  Copy   BIBTEX

Abstract

Two examples of Galois connections and their dual forms are considered. One of them is applied to formulate a criterion when a given subset of a complete lattice forms a complete lattice. The second, closely related to the first, is used to prove in a short way the Knaster-Tarski’s fixed point theorem

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fuzzy Galois Connections.Radim Bêlohlávek - 1999 - Mathematical Logic Quarterly 45 (4):497-504.
Lattices of Fixed Points of Fuzzy Galois Connections.Radim Bělohlávek - 2001 - Mathematical Logic Quarterly 47 (1):111-116.
Fuzzy Galois connections on fuzzy posets.Wei Yao & Ling-Xia Lu - 2009 - Mathematical Logic Quarterly 55 (1):105-112.
Galois structures.Andrzej W. Jankowski - 1985 - Studia Logica 44 (2):109 - 124.
A fixed point theorem for o-minimal structures.Kam-Chau Wong - 2003 - Mathematical Logic Quarterly 49 (6):598.

Analytics

Added to PP
2014-07-11

Downloads
27 (#142,020)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marek Nowak
University of Lodz

Citations of this work

No citations found.

Add more citations

References found in this work

On some application of residuated mappings.Marek Nowak - 2013 - Bulletin of the Section of Logic 42 (1/2):53-68.

Add more references