Abstract
An abstract logic 〈A, C〉 consists of a finitary algebraA and a closure systemC onA. C induces two other closure systems onA, C P andC I, by projective and inductive generation respectively. The various relations amongC, C P andC I are determined. The special case thatC is the standard equational closure system on monadic terms is studied in detail. The behavior of Boolean logics with respect to projective and inductive generation is determined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.J. Brown andR. Suszko,Abstract logics,Dissertationes Mathematicae, Vol. 102 (1973) pp. 5–41.
G. Gratzer,Universal algebra, Princeton (1968).
S. L. Bloom andD. J. Brown,Classical abstract logics,Dissertationes Mathematicae, Vol. 102 (1973) pp. 43–52.
H. Rasiowa andR. Sikorski,The mathematics of metamathematics Warsaw (1963).
Author information
Authors and Affiliations
Additional information
Allatum est die 17 Junii 1975
Rights and permissions
About this article
Cite this article
Bloom, S.L. Projective and inductive generation of abstract logics. Stud Logica 35, 249–255 (1976). https://doi.org/10.1007/BF02282487
Issue Date:
DOI: https://doi.org/10.1007/BF02282487