12. Subset filters

In a non-empty set E, subset filters are exactly filters in the sense of ordered set theory, where the relevant order relation is defined by the ensemblistic inclusion $\subseteq$ .

12.1 Filters

Definition (subset filter (Cartan (1937)). Let E be a non-empty set. A subsetfilter of E, denoted $F$ , is a stack of non-empty subsets of E satisfying the axiom $(F_{sif})$ ...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Subset filters

Previous
page Rasters for subassemblies

Subset ideals

Article included in this offer

"Mathematics"

( 166 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details

Bibliography

(1) - ALLAM (A.A), BAKEIR (M.Y.), ABO-TABL (E.A.) - Some methods for generating topologies by relations, - Bulletin of the Malaysian Mathematical Sciences Society, (2), Vol. 31, No.1, pp. 35-45 (2008).
(2) - BALBES (R.), DWINGER (P.) - Distributive Lattices,...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!