 In general conditionals with a relevance reading tend to behave in rather unusual and unruly ways. Raidl (2021) develops a general technique of transferring completeness results for more “well-behaved” suppositional conditionals \(&gt;\) to relevance-expressing conditionals definable in terms of \(&gt;\). He is thus able to cover the proposal of Crupi and Iacona as well as that of Rott in a unified manner.