On cardinalities of algebras of formulas for -categorical theories
We partially strengthen a result of Shelah from [Sh] by proving that if and is a CCC partial order with e.g. (the successor of ) and then is -linked.
If element of a lattice effect algebra is central, then the interval is a lattice effect algebra with the new top element and with inherited partial binary operation . It is a known fact that if the set of central elements of is an atomic Boolean algebra and the supremum of all atoms of in equals to the top element of , then is isomorphic to a direct product of irreducible effect algebras ([16]). In [10] Paseka and Riečanová published as open problem whether is a bifull sublattice...
In set theory without the axiom of choice (), we study certain non-constructive properties of infinite-dimensional vector spaces. Among several results, we establish the following: (i) None of the principles AC (AC for linearly ordered families of nonempty sets)—and hence AC (AC for well-ordered families of nonempty sets)— (where is an uncountable regular cardinal), and “for every infinite set , there is a bijection ”, implies the statement “there exists a field such that every vector...
We prove that for an unbounded metric space , the minimal character of a point of the Higson corona of is equal to if has asymptotically isolated balls and to otherwise. This implies that under a metric space of bounded geometry is coarsely equivalent to the Cantor macro-cube if and only if and . This contrasts with a result of Protasov saying that under CH the coronas of any two asymptotically zero-dimensional unbounded metric separable spaces are homeomorphic.
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties. We first study the problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL ), a logic introduced by Sorea to express event-based timed specifications. We prove that...
The paper presents a new approach to fuzzy classification in the case of missing data. Rough-fuzzy sets are incorporated into logical type neuro-fuzzy structures and a rough-neuro-fuzzy classifier is derived. Theorems which allow determining the structure of the rough-neuro-fuzzy classifier are given. Several experiments illustrating the performance of the roughneuro-fuzzy classifier working in the case of missing features are described.