On the ‘transitivity’ of consequence relations

Research output: Contribution to journalArticleResearchpeer-review

7 Citations (Scopus)


A binary relation R on a set S is transitive iff for all a,b,c ∈ S, if aRb and bRc, then aRc. This almost never applies to the relations logicians tend to think of as consequence relations; where such relations are relations on a set at all, they are rarely transitive. Yet it is common to hear consequence relations described as ‘transitive’, and to see rules imposed to ensure ‘transitivity’ of these relations. This article attempts to clarify the situation.

Original languageEnglish
Pages (from-to)433-450
Number of pages18
JournalJournal of Logic and Computation
Issue number2
Publication statusPublished - 2018
Externally publishedYes


  • Abstract logic
  • Consequence relations
  • Transitivity

Cite this