Paper

01 Mar 1975

Some theorems on structural consequence operations

View publication

Abstract

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.

Related

Paper

Projective and inductive generation of abstract logics

Stephen L. Bloom

Studia Logica

Paper

A note on the logic of signed equations

Stephen L. Bloom

Studia Logica

Paper

Recursion and iteration in continuous theories: The "M-construction"

Stephen L. Bloom, James W. Thatcher, et al.

Journal of Computer and System Sciences

Paper

Finitary quasi-varieties

Stephen L. Bloom, Jesse B. Wright

Journal of Pure and Applied Algebra

View all publications