We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

Reduced products are generalizations of ultraproducts where the filter used need not be an ultrafilter. With a suitable choice of filter, we can then get a more constructive model of non-standard analysis. We study properties of such reduced products and investigate what classical results are still valid in a constructive setting. A boundedness principle BD, not derivable in pure constructive m...

we consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $x$, $(x, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $x$. we also show that, for a strong residuated lattice $x$, $bigcap {p_{lambda} ,|,p_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or antichains. This allows us to prove some consequences of the Boolean Prime Ideal theorem using arguments in the style of those that use Zorn’s Lemma, or Martin’s Axiom.

We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give ...

In this paper we introduce the notion of Boolean filters in a pseudo-complemented distributive lattice and characterize the class of all Boolean filters. Further a set of equivalent conditions are derived for a proper filter to become a prime Boolean filter. Also a set of equivalent conditions is derived for a pseudo-complemented distributive lattice to become a Boolean algebra. Finally, a Bool...

In this paper the concept of soft fuzzy filter on X, soft fuzzy prime filter on X, soft fuzzy ultrafilter on X, soft fuzzy minimal prime filter collections are introduced. The concept of soft fuzzy limit space (X, ltτ ) and the related properties are discussed. The functor ι from the collection of soft fuzzy filters F(X) to the collection of filters on X and the functor ω defined from the colle...

A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter, each of which can be partitioned into an ideal and a filter, etc., until you reach 1-element lattices. In this note, we find a quasi-equational basis for the pseudoquasivariety of interval dismantlable lattices, and show that there are infinitely many minimal interval non-dismantlable lattices. Define...

Abstract In this paper, the notions of maximal GE-filter and prime a GE-algebra are introduced relation between them is given. Some characterizations GE-filters transitive given in terms generated by subset GE-algebra. We generalized Stone’s theorem to GE-algebras. The notion elitable bordered investigated its properties. observed that class all complete distributive lattice. Equivalent conditi...