We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product representation of bilattices and applies the guidelines of the multi-type methodology in the design of display calculi.BL. For CBL we also need the following translation for the conflation connective:The following proposition is immediate.Proposition 5.1. For every formula A of BL (resp. CBL), the sequents t 1 (A) ⊢ t 1 (A) and t 2 (A) ⊢ t 2 (A) are derivable in D.BL (resp. D.CBL).Proof. By induction on the complexity of the formula A. If A is an atomic formula, the translation of t i (A) ⊢ t i (A) with i ∈ {1, 2} is A i ⊢ A i , hence it is derivable using (Id) in L 1 and L 2 , respectively. If A = A 1 ⊗ A 2 , then t i (A 1 ⊗ A 2 ) = t i (A 1 ) ⊓ 1 t i (A 2 ) and if A = A 1 ⊕ A 2 , then t i (A 1 ⊕ A 2 ) = t i (A 1 ) ⊔ 1 t i (A 2 ). By induction hypothesis, t i (A i ) ⊢ t i (A i ). So, it is enough to show that: