Learn More
Connexive logic differs from other alternatives to classical two-valued logic in containing theses such as ~(p→~p) and (p→q)→~(p→~q) which are two-valuedly false. In this paper a semantic tableau formulation of connexive logic is constructed, using classical tableau rules plus an additional rule enabling a contradiction to be derived from any tableau item(More)