Combining word problems through rewriting in categories with products
From MaRDI portal
Publication:1398463
DOI10.1016/S0304-3975(01)00248-1zbMath1028.68070MaRDI QIDQ1398463
Camillo Fiorentini, Silvio Ghilardi
Publication date: 29 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Combining word problems through rewriting in categories with products ⋮ Deciding the word problem in the union of equational theories. ⋮ A new combination procedure for the word problem that generalizes fusion decidability results in modal logics ⋮ Model-theoretic methods in combined constraint satisfiability ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures
Cites Work
- Unnamed Item
- Unnamed Item
- Combining matching algorithms: The regular case
- An algebraic theory of normal forms
- Combining word problems through rewriting in categories with products
- Deciding the word problem in the union of equational theories.
- Categories of continuous functors. I
- Modal logics withn-ary connectives
- The join of equational theories
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
