The search session has expired. Please query the service again.
This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean Algebras with...
This paper gives a semantical underpinning for a many-sorted modal
logic associated with certain dynamical systems, like transition
systems, automata or classes in object-oriented languages. These
systems will be described as coalgebras of so-called polynomial
functors, built up from constants and identities, using products,
coproducts and powersets. The semantical account involves Boolean
algebras with operators indexed by polynomial functors, called MBAOs,
for Many-sorted Boolean Algebras with...
We show that an ideal I of an MV-algebra A is linearly ordered if and only if every non-zero element of I is a molecule. The set of molecules of A is contained in Inf(A) ∪ B2(A) where B2(A) is the set of all elements x ∈ A such that 2x is idempotent. It is shown that I ≠ {0} is weakly essential if and only if B⊥ ⊂ B(A). Connections are shown among the classes of ideals that have various combinations of the properties of being implicative, essential, weakly essential, maximal or prime.
The concept of monadic MV-algebra was recently introduced by A. Di Nola and R. Grigolia as an algebraic formalization of the many-valued predicate calculus described formerly by J. D. Rutledge [9]. This was also genaralized by J. Rachůnek and F. Švrček for commutative residuated -monoids since MV-algebras form a particular case of this structure. Basic algebras serve as a tool for the investigations of much more wide class of non-classical logics (including MV-algebras, orthomodular lattices and...
We prove that there is a one to one correspondence between monadic finite quasi-modal operators on a distributive nearlattice and quantifiers on the distributive lattice of its finitely generated filters, extending the results given in ``Calomino I., Celani S., González L. J.: Quasi-modal operators on distributive nearlattices, Rev. Unión Mat. Argent. 61 (2020), 339--352".
Bounded integral residuated lattices form a large class of algebras containing some classes of commutative and noncommutative algebras behind many-valued and fuzzy logics. In the paper, monotone modal operators (special cases of closure operators) are introduced and studied.
Currently displaying 1 –
8 of
8