TY - GEN
T1 - ‘Transitivity’ of consequence relations
AU - Ripley, David
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84951081318&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-48561-3_27
DO - 10.1007/978-3-662-48561-3_27
M3 - Conference Paper
AN - SCOPUS:84951081318
SN - 9783662485606
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 328
EP - 340
BT - Logic, Rationality, and Interaction - 5th International Workshop, LORI 2015, Proceedings
A2 - Wang, Wen-Fang
A2 - van der Hoek, Wiebe
A2 - Holliday, Wesley H.
PB - Springer
T2 - 5th International Workshop on Logic, Rationality, and Interaction, LORI 2015
Y2 - 28 October 2015 through 31 October 2015
ER -