scientific article; zbMATH DE number 3070503
From MaRDI portal
Publication:5810602
Cited in
(63)- Arrow categories
- Relation algebras: Concept of points and representability
- Relational algebraic semantics of deterministic and nondeterministic programs
- Matrix relation algebras
- Computation of Aristotle's and Gergonne's syllogisms
- An abstract theory of invertible relations
- Boolean modules
- Relation algebraic domain constructions
- Subsumption computed algebraically
- Some sufficient conditions for the representability of relation algebras
- Unifying threads in Alfred Tarski's work
- Notions of density that imply representability in algebraic logic
- Peirce algebras
- A relation algebraic model of robust correctness
- Relation-algebraic semantics
- Parallel constructions of maximal path sets and applications to short superstrings
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Representation theory of Goguen categories.
- A new algebraic approach to L-fuzzy relations convenient to study crispness
- Functionally dense relation algebras
- Three-variable statements of set-pairing
- Relation algebras as expanded FL-algebras
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- A relation algebraic approach to interaction categories
- On equational theories of varieties of anticommutative rings
- Relation algebras of intervals
- Relation algebras of Sugihara, Belnap, Meyer, and Church
- Varieties of semiassociative relation algebras and tense algebras
- Relational demonic fuzzy refinement
- General composition of relations
- A relational division operator: The conjugate kernel
- On fork arrow logic and its expressive power
- Nondeterministic semantics of compound diagrams
- Congruences and ideals on Peirce algebras: a heterogeneous/homogeneous point of view
- Relation Algebras, Matrices, and Multi-valued Decision Diagrams
- Congruences and ideals on Boolean modules: a heterogeneous point of view
- A Relation Algebraic Semantics for a Lazy Functional Logic Language
- Some Varieties Containing Relation Algebras
- Pair-Dense Relation Algebras
- Relational properties of sequential composition of coalgebras
- Dynamic logic with program specifications and its relational proof system
- Distributed Relation Logic
- Layered map reasoning: an experimental approach put to trial on sets
- Tarskian Classical Relevant Logic
- First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
- On Tarski's axiomatic foundations of the calculus of relations
- Symmetric quotients and domain constructions
- Goals and benchmarks for automated map reasoning
- Finite methods in 1-order formalisms
- Finite, integral, and finite-dimensional relation algebras: A brief history
- Embedding modular lattices into relation algebras
- Seurat games on Stockmeyer graphs
- Equationally distinct countable simple {\textsf{Q}}-relation algebras
- Adding design strategies to fork algebras
- Embedding a demonic semilattice in a relation algebra
- Failure of Beth's theorem in relevance logics
- Membership values in arrow categories
- On the dual composition of relations
- A sequent calculus for relation algebras
- Varieties of relation algebras
- A portrait of Alfred Tarski
- Interpretability of first-order linear temporal logics in fork algebras
- Łukasiewicz-Moisil relation algebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5810602)