Stephen L. Bloom
Studia Logica
Two characterizations are given of those structural consequence operations on a propositional language which can be defined via proofs from a finite number of polynomial rules. © 1975 Warzawa.
Stephen L. Bloom
Studia Logica
Stephen L. Bloom, Susanna Ginali, et al.
Journal of Computer and System Sciences
Stephen L. Bloom, James W. Thatcher, et al.
Journal of Computer and System Sciences
Stephen L. Bloom
Studia Logica