Definition (Lindenbaum-Tarski algebra). Let Q be a logical doctrine (CPC, IPC, etc), L be a propositional language, and T be an L-theory. The Lindenbaum-Tarski algebra FQ(T) is built in the following way:

  • The underlying set of FQ(T) is the set of equivalence classes [φ] of propositions φ, where φ∼ψ when T,φ⊢Qψ and T,ψ⊢Qφ;

  • If ⋈ is a logical connective in the fragment Q, we set [φ]⋈[ψ]:=[φ⋈ψ] (should check well-defined: exercise).