The following pages link to (Q3126000):
Displaying 12 items.
- Notions of density that imply representability in algebraic logic (Q1295366) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations (Q1377626) (← links)
- Squares in fork arrow logic (Q1402582) (← links)
- The finitely axiomatizable complete theories of non-associative arrow frames (Q1731561) (← links)
- On fork arrow logic and its expressive power (Q2454871) (← links)
- Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition (Q2817938) (← links)
- Exponential-Size Model Property for PDL with Separating Parallel Composition (Q2946330) (← links)
- Simulating polyadic modal logics by monadic ones (Q3160548) (← links)
- A Completeness Result for Relation Algebra with Binders (Q4916210) (← links)
- Arrows Pointing at Arrows: Arrow Logic, Relevance Logic, and Relation Algebras (Q5249693) (← links)
- Algebraic Logic, Where Does it Stand Today? (Q5472642) (← links)
