Theoria. Revista de Teoría, Historia y Fundamentos de la Ciencia

Volume 1, Issue 1, 1985

Systems with the converse Ackermann property

A system S has the “converse Ackermann property” (C.A.P.) if (A -> B) -> C is unprovable in S whenever C is a propositional variable. In this paper we define the fragments with the C.A.P. of some well-know propositional systems in the spectrum between the minimal and classical logic. In the first part we succesively study the implicative and positive fragments and the full calculi. In the second, we prove by a matrix method that each one of the systems has the C.A.P. Thus, we think the problem proposed in Anderson & Belnap (1975) § 8.12 has been solved.