Algebraic aspects of deduction theorems
Abstract
By a sentential logic we understand a pair, where S is a sentential language, i.e. an absolutely free algebra freely generated by an infinite set p, q, r,... of sentential variables and endowed with countably many finitary connectives §1, §2,... and C is a consequence operation on S, the underlying set of S, satisfying the condition of structurality: eC ⊆ C, for every endomorphism e of S and for every X ⊆ S. If no confusion is likely we shall identify a logic with its consequence operation C. A logic C is standard if C = [ {C : Y ⊆ X & Y is finite}, for all X ⊆ S.