ISSN:
1572-8730
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Philosophy
Notes:
Abstract A prepositional logic S has the “Converse Ackermann Property” (CAP) if (A→B)→C is unprovable in S when C does not contain →. In “A Routley-Meyer semantics for Converse Ackermann Property” (Journal of Philosophical Logic, 16 (1987), pp. 65–76) I showed how to derive positive logical systems with the CAP. There I conjectured that each of these positive systems were compatible with a so-called “semiclassical” negation. In the present paper I prove that this conjecture was right. Relational Routley-Meyer type semantics are provided for each one of the resulting systems (the positive systems plus the semiclassical negation).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00370290