Projective and inductive generation of abstract logics

Studia Logica 35 (3):249 - 255 (1976)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Undecidable theories of Lyndon algebras.Vera Stebletsova & Yde Venema - 2001 - Journal of Symbolic Logic 66 (1):207-224.
Failure of interpolation in relevant logics.Alasdair Urquhart - 1993 - Journal of Philosophical Logic 22 (5):449 - 479.
Projective prewellorderings vs projective wellfounded relations.Xianghui Shi - 2009 - Journal of Symbolic Logic 74 (2):579-596.
Abstract modal logics.Ramon Jansana - 1995 - Studia Logica 55 (2):273 - 299.
A first approach to abstract modal logics.Josep M. Font & Ventura Verdú - 1989 - Journal of Symbolic Logic 54 (3):1042-1062.
Deductively Definable Logies of Induction.John D. Norton - 2010 - Journal of Philosophical Logic 39 (6):617 - 654.

Analytics

Added to PP
2009-01-28

Downloads
21 (#715,461)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Equivalential logics (II).Janusz Czelakowski - 1981 - Studia Logica 40 (4):355 - 372.
Reduced products of logical matrices.Janusz Czelakowski - 1980 - Studia Logica 39 (1):19 - 43.

Add more citations

References found in this work

No references found.

Add more references