BibTeX
@MISC{Kornilowicz_introductionto,
author = {Artur Kornilowicz},
title = {Introduction to Meet-Continuous Topological Lattices},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Introduction to Meet-Continuous Topological Lattices 1 Artur Korni#lowicz University of Bia#lystok MML Identifier: YELLOW13. WWW: http://mizar.org/JFM/Vol10/yellow13.html The articles [23], [29], [7], [28], [30], [6], [10], [19], [26], [20], [31], [27], [9], [15], [13], [14], [1], [21], [4], [24], [5], [22], [2], [3], [12], [11], [8], [32], [16], [17], [25], and [18] provide the notation and terminology for this paper. 1. Preliminaries Let S be a finite 1-sorted structure. One can check that the carrier of S is finite. Let S be a trivial 1-sorted structure. Observe that the carrier of S is trivial. Let us observe that every set which is trivial is also finite. One can check that every 1-sorted structure which is trivial is also finite. Let us note that every 1-sorted structure which is non trivial is also non empty. One can verify the following observations:<F17.2
