An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
Some new results that provide refinements and reverses of the Cauchy-Bunyakovsky-Schwarz (CBS) -inequality in the general setting of Measure Theory and under some boundedness condi...
Abstract. We investigate the set theoretical strength of some properties of normality, including Urysohn’s Lemma, Tietze-Urysohn Extension Theorem, normality of disjoint unions o...
Paul E. Howard, Kyriakos Keremedis, Herman Rubin, ...
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
The goal of this paper is to push forward the development of the apparatus of the Fuzzy Class theory. We concentrate on three areas: strengthening the universal quantifier, forma...