On constructible falsity in the constructive logic with strong negation
Andrzej Białynicki-Birula, H. Rasiowa (1958)
Colloquium Mathematicum
Similarity:
Andrzej Białynicki-Birula, H. Rasiowa (1958)
Colloquium Mathematicum
Similarity:
Bozić, Milan (1980)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Belnap, Nuel D. jr., Spencer, Joel H. (1966)
Portugaliae mathematica
Similarity:
Dumitru Buşneag, Florentina Chirteş (2007)
Open Mathematics
Similarity:
For an n-valued Łukasiewicz-Moisil algebra L (or LM n-algebra for short) we denote by F n(L) the lattice of all n-filters of L. The goal of this paper is to study the lattice F n(L) and to give new characterizations for the meet-irreducible and completely meet-irreducible elements on F n(L).
Loureiro, Isabel (1980)
Portugaliae mathematica
Similarity:
Cogan, Eva (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Adam Grabowski (2013)
Formalized Mathematics
Similarity:
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone representation theorem [18] for Boolean or Heyting lattices. The main aim of the present article...
Maurizio Negri (2002)
Bollettino dell'Unione Matematica Italiana
Similarity:
We introduce Kleene's 3-valued logic in a language containing, besides the Boolean connectives, a constant for the undefined truth value, so in developing semantics we can switch from the usual treatment based on DM-algebras to the narrower class of DMF-algebras (De Morgan algebras with a single fixed point for negation). A sequent calculus for Kleene's logic is introduced and proved complete with respect to threevalent semantics. The completeness proof is based on a version of the...