Access the full text.
Sign up today, get DeepDyve free for 14 days.
Chapter 10 10.1 Frame – Rough Set Systems and Chain-Based Lattices The equivalence between semi-simple Nelson algebras and three-valued L ukasiewicz algebras was stated in [Monteiro, 1967]. The transformation stated in Example 6.5.1 at point 5 is supported by the following results from [Epstein & Horn, 1974a]): Lemma 10.1.1. If A = A, ∨, ∧, ¬,0= e ≤ ... ≤ e =1 is a 0 n−1 pseudo-complemented P -lattice, then A has a chain base f ≤ f ≤ 0 0 1 ... ≤ f s.t. f is the smallest dense element of A. n−1 1 Lemma 10.1.2. If A = A, ∨, ∧, ¬, =⇒,0= e ≤ ... ≤ e =1 is 0 n−1 a P -lattice and A, ∨, ∧, ¬, =⇒, 0, 1 is a Heyting algebra, then there exists a chain base 0= f ≤ f ≤ ... ≤ f =1 s.t. A, ∨, ∧, ¬, →, 0 1 n−1 0= f ≤ f ≤ ... ≤ f =1 is a P -lattice. 0 1 n−1 1 In order to get the required chain base one can refer to Lemma 10.1.1, taking as f the ﬁrst dense element of A, and inductively as f
Published: Jan 1, 2008
Keywords: Boolean Algebra; Atomic Formula; Kripke Model; Heyting Algebra; Stone Algebra
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.