A Truthmaker Semantics for Wansing's C

Abstract

The aim of this thesis is to provide a truthmaker semantics for the propositional connexive logic C as introduced by Heinrich Wansing. In order to get a truthmaker semantics for C, we first combine parts of the previously established results for first degree entailment and full intuistionistic logic. We therefore review these logics, as well as C, and briefly address the relation between them. We introduce truthmaker semantics along with its underlying mathematical foundation. Afterwards, we go through the truthmaker semantics for first degree entailment and for positive intuitionistic logic. Finally, we provide a truthmaker semantics for C. The result obtained is contingent on the conjecture that there is a finite tree model for every countermodel in C.