On Representations in Banach Spaces.
On representations of logics
On Reproductive Solutions Of Arbitrary Equations
On reproductive solutions of arbitrary equations.
On reproductive solutions of Boolean equations.
On resemblance and recursive isomorphism types of bounded partial recursive functions.
On resemblance and recursive isomorphism types of partial recursive functions.
On reverses of some binary operators
The notion of reverse of any binary operation on the unit interval is introduced. The properties of reverses of some binary operations are studied and some applications of reverses are indicated.
On rigid relation principles in set theory without the axiom of choice
We study the deductive strength of the following statements: 𝖱𝖱: every set has a rigid binary relation, 𝖧𝖱𝖱: every set has a hereditarily rigid binary relation, 𝖲𝖱𝖱: every set has a strongly rigid binary relation, in set theory without the Axiom of Choice. 𝖱𝖱 was recently formulated by J. D. Hamkins and J. Palumbo, and 𝖲𝖱𝖱 is a classical (non-trivial) 𝖹𝖥𝖢-result by P. Vopěnka, A. Pultr and Z. Hedrlín.
On Rough Subgroup of a Group
This article describes a rough subgroup with respect to a normal subgroup of a group, and some properties of the lower and the upper approximations in a group.
On saturated almost disjoint families
On saturated ideals and
On saturated sets of Boolean rings and Ulam's problem on sets measures
On saturated sets of ideals and Ulam's problem
On saturating ultrafilters on N
On Scheepers' conjecture
On Semantics of a Term Calculus for Classical Logic
On semialgebraic points of definable sets
We prove that the semialgebraic, algebraic, and algebraic nonsingular points of a definable set in o-minimal structure with analytic cell decomposition are definable. Moreover, the operation of taking semialgebraic points is idempotent and the degree of complexity of semialgebraic points is bounded.
On Semi-Boolean-Like Algebras
In a previous paper, we introduced the notion of Boolean-like algebra as a generalisation of Boolean algebras to an arbitrary similarity type. In a nutshell, a double-pointed algebra with constants is Boolean-like in case for all the congruences and are complementary factor congruences of . We also introduced the weaker notion of semi-Boolean-like algebra, showing that it retained some of the strong algebraic properties characterising Boolean algebras. In this paper, we continue the investigation...
On semisimple bands.