Studia Logica

, Volume 99, Issue 1, pp 279-319

First online:

Contextual Deduction Theorems

  • J. G. RafteryAffiliated withSchool of Mathematical Sciences, University of KwaZulu-Natal (Westville Campus) Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Logics that do not have a deduction-detachment theorem (briefly, a DDT) may still possess a contextual DDT—a syntactic notion introduced here for arbitrary deductive systems, along with a local variant. Substructural logics without sentential constants are natural witnesses to these phenomena. In the presence of a contextual DDT, we can still upgrade many weak completeness results to strong ones, e.g., the finite model property implies the strong finite model property. It turns out that a finitary system has a contextual DDT iff it is protoalgebraic and gives rise to a dually Brouwerian semilattice of compact deductive filters in every finitely generated algebra of the corresponding type. Any such system is filter distributive, although it may lack the filter extension property. More generally, filter distributivity and modularity are characterized for all finitary systems with a local contextual DDT, and several examples are discussed. For algebraizable logics, the well-known correspondence between the DDT and the equational definability of principal congruences is adapted to the contextual case.


Deductive system deduction-detachment theorem protoalgebraic algebraizable quasivariety EDPC distributive modular substructural logics