Rough subalgebras of some binary algebras connected with logics.
Roughness in -graphs
-graphs are a type of graphs associated to groups, which were proposed by A. Bretto and A. Faisant (2005). In this paper, we first give some theorems regarding -graphs. Then we introduce the notion of rough -graphs and investigate some important properties of these graphs.
Roughness of Filters in Lattice Implication Algebras
As a generalization of filters in lattice implication algebras, the notion of rough filters in lattice implication algebras is introduced, and some of their properties are considered.
Rückert Nullstellensatz for normed, non-discrete fields using non-standard analysis.
Rudin-like sets and hereditary families of compact sets
We show that a comeager Π₁¹ hereditary family of compact sets must have a dense subfamily which is also hereditary. Using this, we prove an “abstract” result which implies the existence of independent ℳ ₀-sets, the meagerness of ₀-sets with the property of Baire, and generalizations of some classical results of Mycielski. Finally, we also give some natural examples of true sets.
Rudin's Dowker space in the extension with a Suslin tree
We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same can be forced...