Add to ORKGUnifiability of terms (and formulas) and structural completeness in the variety of relation algebras RA and in the products of modal logic S5 is investigated. Nonunifiable terms (formulas) which are satisfiable in varieties (in logics) are exhibited. Consequently, RA and products of S5 as well as representable diagonal-free n-dimensional cylindric algebras, RDfn, are almost structurally complete but not structurally complete. In case of S5n a basis for admissible rules and the form of all passive rules are provided
Abstract. We give an informal description of a recursive representability-preserving reduction of re...
We prove that every n-modal logic between K^n and S5^n is undecidable, whenever n >=3. We also sh...
We prove that algebras of binary relations whose similarity type includes intersection, composition,...
Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras...
We exhibit a quasi-projectional relation algebra reduct of any diagonal-free cylindric algebra of di...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
Fix a finite ordinal \(n\geq 3\) and let \(\alpha\) be an arbitrary ordinal. Let \(\mathsf{CA}_n\) d...
Relation algebras are algebras arising from the study of binary relations.They form a part of the fi...
In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results ...
In this paper we show that relativized versions of relation set algebras and cylindric set algebras ...
AbstractFor any finite n ⩾ 3 there are two atomic n-dimensional cylindric algebras with the same ato...
In this work we study the notions of structural and universal completeness both from the algebraic a...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
AbstractVersions and extensions of intuitionistic and modal logic involving biHeyting and bimodal op...
We characterise the class SRaCAn of subalgebras of relation algebra reducts of n-dimensional cylindr...
Abstract. We give an informal description of a recursive representability-preserving reduction of re...
We prove that every n-modal logic between K^n and S5^n is undecidable, whenever n >=3. We also sh...
We prove that algebras of binary relations whose similarity type includes intersection, composition,...
Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras...
We exhibit a quasi-projectional relation algebra reduct of any diagonal-free cylindric algebra of di...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
Fix a finite ordinal \(n\geq 3\) and let \(\alpha\) be an arbitrary ordinal. Let \(\mathsf{CA}_n\) d...
Relation algebras are algebras arising from the study of binary relations.They form a part of the fi...
In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results ...
In this paper we show that relativized versions of relation set algebras and cylindric set algebras ...
AbstractFor any finite n ⩾ 3 there are two atomic n-dimensional cylindric algebras with the same ato...
In this work we study the notions of structural and universal completeness both from the algebraic a...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
AbstractVersions and extensions of intuitionistic and modal logic involving biHeyting and bimodal op...
We characterise the class SRaCAn of subalgebras of relation algebra reducts of n-dimensional cylindr...
Abstract. We give an informal description of a recursive representability-preserving reduction of re...
We prove that every n-modal logic between K^n and S5^n is undecidable, whenever n >=3. We also sh...
We prove that algebras of binary relations whose similarity type includes intersection, composition,...