Reflexive and antisymmetric relations and their systems
Regressive sets of order n.
Regular closure and corresponding versions of and
Regular elements and Green's relations in Menger algebras of terms
Defining an (n+1)-ary superposition operation on the set of all n-ary terms of type τ, one obtains an algebra of type (n+1,0,...,0). The algebra n-clone τ is free in the variety of all Menger algebras ([9]). Using the operation there are different possibilities to define binary associative operations on the set and on the cartesian power . In this paper we study idempotent and regular elements as well as Green’s relations in semigroups of terms with these binary associative operations...
Regular elements of the semigroup of all binary relations.
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular spaces of small extent are ω-resolvable
We improve some results of Pavlov and Filatova, concerning a problem of Malykhin, by showing that every regular space X that satisfies Δ(X) > e(X) is ω-resolvable. Here Δ(X), the dispersion character of X, is the smallest size of a non-empty open set in X, and e(X), the extent of X, is the supremum of the sizes of all closed-and-discrete subsets of X. In particular, regular Lindelöf spaces of uncountable dispersion character are ω-resolvable. We also prove that any regular...
Regularity and normality on L-topological spaces. I.
Regularly full logics and the uniqueness problem for observables
Rekursionszahlen und die Grzegorczyk-Hierarchie.
Rekursive Unentscheidbarkeit der Theorie der pythagoräischen Körper
Relating automata-theoretic hierarchies to complexity-theoretic hierarchies
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy. This extends a result of Burtschik and Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the Boolean hierarchy and the plus-hierarchy.
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy. This extends a result of Burtschik and Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the Boolean hierarchy and the plus-hierarchy.
Relation between (fuzzy) Gödel ideals and (fuzzy) Boolean ideals in BL-algebras
In this paper, we study relationships between among (fuzzy) Boolean ideals, (fuzzy) Gödel ideals, (fuzzy) implicative filters and (fuzzy) Boolean filters in BL-algebras. In [9], there is an example which shows that a Gödel ideal may not be a Boolean ideal, we show this example is not true and in the following we prove that the notions of (fuzzy) Gödel ideals and (fuzzy) Boolean ideals in BL-algebras coincide.
Relation entre le rang U et le poids
Relational Formal Characterization of Rough Sets
The notion of a rough set, developed by Pawlak [10], is an important tool to describe situation of incomplete or partially unknown information. In this article, which is essentially the continuation of [6], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library). Here we drop the classical equivalence- and tolerance-based models of rough...
Relational monoids, multirelations, and quantalic recognizers
Relational quotients
Let 𝒦 be a class of finite relational structures. We define ℰ𝒦 to be the class of finite relational structures A such that A/E ∈ 𝒦, where E is an equivalence relation defined on the structure A. Adding arbitrary linear orderings to structures from ℰ𝒦, we get the class 𝒪ℰ𝒦. If we add linear orderings to structures from ℰ𝒦 such that each E-equivalence class is an interval then we get the class 𝒞ℰ[𝒦*]. We provide a list of Fraïssé classes among ℰ𝒦, 𝒪ℰ𝒦 and 𝒞ℰ[𝒦*]. In addition, we classify...
Relational specifications