I haven't found any posts related to Algebraic Logic, but I'll try anyway; here it is:
Some notions:
A logic is algebraizable when there is a class $K$ of algebras an there are structural Transformers $\tau,\rho$ (from formulas into equations and from equations into formulas, respectively) such that the following are satisfied, for all $\Gamma \cup \varphi \subseteq Fm$ and all $\Theta \cup$ $\{\epsilon \approx \delta\}\subseteq Eq$:
ALG1. $\Gamma \vdash_\mathcal{L} \varphi$ $\Longleftrightarrow$ $\tau\Gamma \models_K \tau\varphi$.
ALG2. $\Theta \models_K \epsilon \approx \delta$ $\Longleftrightarrow$ $\rho\Theta \vdash_\mathcal{L} \rho(\epsilon \approx \delta)$
ALG3. $\varphi \dashv \vdash_\mathcal{L} \rho \tau \varphi$.
ALG4. $\epsilon \approx \delta =\models_K \tau \rho(\epsilon \approx \delta)$.
In such a case, the class $K$ is said to be the equivalent algebraic semantics for $\mathcal{L}$.
A Logic is said to be regularly algebraizable when it is algebraizable and satisfies:
$({G})$ $x, y \vdash_{\mathcal{L}} \Delta(x,y)$
for any non-empty set $\Delta(x,y)$ of equivalence formulas.
Here the problem:
Let $\mathcal{L}$ be regularly algebraizable, with equivalent algebraic semantics the class $K$.
- If $\varphi, \psi$ are any two theorems of $\mathcal{L}$, then $K\models \varphi \approx \psi$.
- If $\varphi$ is any theorem of $\mathcal{L}$, then $\varphi$ is an algebraic constant of the class ${K}$.
Any help would be really appreciated.