Sciweavers

6833 search results - page 9 / 1367
» Some two-character sets
Sort
View
FUIN
2010
98views more  FUIN 2010»
13 years 4 months ago
On the Borel Complexity of MSO Definable Sets of Branches
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...
APPML
2010
150views more  APPML 2010»
13 years 5 months ago
On some integral inequalities related to the Cauchy-Bunyakovsky-Schwarz inequality
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...
N. S. Barnett, Sever Silvestru Dragomir, I. Gomm
MLQ
1998
103views more  MLQ 1998»
13 years 7 months ago
Versions of Normality and Some Weak Forms of the Axiom of Choice
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, ...
GD
2009
Springer
13 years 10 months ago
Complexity of Some Geometric and Topological Problems
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...
Marcus Schaefer
EUSFLAT
2007
105views Fuzzy Logic» more  EUSFLAT 2007»
13 years 8 months ago
Fuzzy Class Theory: Some Advanced Topics
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...
Petr Cintula, Rostislav Horcík