14 problems
- 0 votes0 replies0 views
Finite simple CKL-algebras conjecture
Let be a finite CKL-algebra, meaning an L-algebra satisfying the CKL axioms. Call simple if it has no nontrivial ideals, and call it linear if its underlying order is linea…
- 0 votes0 replies0 views
Conjecture that all simple CKL-algebras are linear
A CKL-algebra is an algebra in the class of L-algebras satisfying the CKL axioms; an L-algebra is simple when it has no nontrivial ideals, and it is linear when its underlying orde…
- 0 votes0 replies0 views
Finite axiomatizability of transposition operations over the semantic formula-algebra
Let \text{{mathcal Fm}}^+\!\slash\!\!\equiv be the formula-algebra expanded by transposition operations and quotiented by semantic equivalence, and let \text{{mathcal Fm}…
- 0 votes0 replies0 views
Monk's conjecture on the non-finite axiomatizability of equational first-order logic
Let be any conception of a set algebra corresponding to the notion of satisfaction, and let be the corresponding class for any choice of basic operatio…
- 0 votes0 replies0 views
Monk's conjecture on the non-finite axiomatizability of representable relation algebras
A relation algebra is an algebraic structure with the operations used to express the equational form of first-order logic; a class is finitely axiomatizable if it can be defined by…
- 0 votes0 replies0 views
Isomorphism conjecture for the algebra constructed in the semantic cut-elimination proof
Let be the algebra constructed in Section 4, and let be the Galois algebra constructed by Galatos and Jipsen. Isomorphism conjecture. The algebra is isomorphic to .…
- 0 votes0 replies0 views
Non-surjectivity conjecture for algebraic correspondence from strict implication
Non-surjectivity conjecture. Not all -sequents have their algebraic correspondents in .
- 0 votes0 replies1 view
Non-correspondence conjecture for the symmetry, Euclidean and density sequents
Non-correspondence conjecture. The sequents (Sym), (Euc) and (D) never correspond to any -sequents.
- 0 votes0 replies0 views
Conjecture on tractable decision procedures for fixed-variable equational theories
Fixed-variable tractability conjecture. For each fixed number of variables, the decision problem admits a more tractable decision procedure.
- 0 votes0 replies0 views
The Jonsson- witness conjecture
Let denote the parameter used for the witness in the surrounding construction, and let Jonsson's 's denote the corresponding family of candidate structures. Jonsson- witn…
- 0 votes0 replies0 views
The relation-algebra witness conjecture
The discussion concerns relation algebras and the construction of concrete witnesses with finite atom structures. Relation-algebra witness conjecture. The authors conjecture that t…
- 0 votes0 replies0 views
The conjecture on diagonal-free equations distinguishing the two rainbow algebras
Rainbow indistinguishability conjecture. The two algebras cannot be distinguished by any -variable diagonal-free equation.
- 0 votes0 replies0 views
The graph-colouring characterization of strong representability for α(G)
Strong representability conjecture for . The relation-algebra atom structure is strongly representable if and only if i…
- 0 votes0 replies0 views
The variety of monadic De Morgan reducts of double-suited IFG-algebras
Let a monadic De Morgan reduct be the reduct of a suited IFG-algebra to the signature … Let be the variety defined in the surrounding algebraic framewor…