‘Transitivity’ of consequence relations

Research output: Chapter in Book/Report/Conference proceedingConference PaperOtherpeer-review

2 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 paper attempts to clarify the situation.

Original languageEnglish
Title of host publicationLogic, Rationality, and Interaction - 5th International Workshop, LORI 2015, Proceedings
Subtitle of host publicationProceedings of LORI V
EditorsWen-Fang Wang, Wiebe van der Hoek, Wesley H. Holliday
Number of pages13
ISBN (Print)9783662485606
Publication statusPublished - 2015
Externally publishedYes
Event5th International Workshop on Logic, Rationality, and Interaction, LORI 2015 - Taipei, Taiwan
Duration: 28 Oct 201531 Oct 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Logic, Rationality, and Interaction, LORI 2015

Cite this