On successors in cardinal arithmetic
On Supernormal Ehresmann-Dedecker Universes.
On Symmetric and Antisymmetric Relations.
On systems of congruences on principal filters of orthomodular implication algebras
Orthomodular implication algebras (with or without compatibility condition) are a natural generalization of Abbott’s implication algebras, an implication reduct of the classical propositional logic. In the paper deductive systems (= congruence kernels) of such algebras are described by means of their restrictions to principal filters having the structure of orthomodular lattices.
On the additivity of the cardinalities of fuzzy sets of type II.
In this short note we show that for fuzzy sets of type II the additive rule for cardinalities holds true. The proof of this result requires an application of approximate reasoning as means of inference by use of the entailment principle.
On the adjunction of any semiset to the system of -classes in AST
On the Algebraic Complexity of Sets of Functions
On the algebraic structure of fuzzy sets of type 2
On the algebraic structure of the process of forming subsequences
On the averaging method for differential equations with delay.
On the axiom of choice for families of finite sets
On the axiomatisation of Boolean categories with and without medial.
On the Axiomatizability of Certain Classes of Modules.
On the Beth property in extension of Lukasiewicz logics.
On the Boffa alternative
Let G* denote a nonprincipal ultrapower of a group G. In 1986 M.~Boffa posed a question equivalent to the following one: if G does not satisfy a positive law, does G* contain a free nonabelian subsemigroup? We give the affirmative answer to this question in the large class of groups containing all residually finite and all soluble groups, in fact, all groups considered in traditional textbooks on group theory.
On the Boolean structure generated by -points of
On the Borel class of the derived set operator
On the Borel class of the derived set operator. II
On the bounding, splitting, and distributivity numbers
The cardinal invariants of are known to satisfy that . We prove that all inequalities can be strict. We also introduce a new upper bound for and show that it can be less than . The key method is to utilize finite support matrix iterations of ccc posets following paper Ultrafilters with small generating sets by A. Blass and S. Shelah (1989).
On the bounds of the minimal length of sequences representing simply ordered sets.