We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of �ticket entailment� proposed by Anderson and Belnap. This answers a question posed by R. K. Meyer.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados