Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T03:10:35.185Z Has data issue: false hasContentIssue false

HOW A SEMANTICS FOR TONK SHOULD BE

Published online by Cambridge University Press:  03 February 2015

ANDREAS FJELLSTAD*
Affiliation:
University Of Aberdeen
*
*DEPARTMENT OF PHILOSOPHY UNIVERSITY OF ABERDEEN OLD BREWERY AB24 3UB ABERDEEN E-mail: a.fjellstad@abdn.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper explores how a semantics for Prior’s infamous connective tonk should be, a connective defined by inference rules that trivialize the logic of a deductive system if that logic is supposed to be transitive. To avoid triviality, one must reject transitivity and in a relatively recent paper, Roy Cook develops a semantics for tonk with non-transitive entailment. However, I show in this paper that a cut-free sequent calculus for tonk - the arguably most natural and simplest deductive system for a non-transitive logic - can neither be complete with respect to Cook’s semantics nor with respect to a semantics with non-transitive entailment based on a semantics for vagueness and transparent truth developed by Cobreros et al. It is argued that the failure to adequately represent tonk is connected with the fact that tonk is not uniquely defined in a cut-free sequent calculus system unless the logic is in addition non-reflexive. To remedy this, the paper develops a semantics with non-transitive and non-reflexive entailment based on the idea that complex formulae are true or false relative to them being assessed as premise or as conclusion.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2015