Some theorems on structural entailment relations

Studia Logica 42 (4):417 - 429 (1983)
  Copy   BIBTEX

Abstract

The classesMatr( ) of all matrices (models) for structural finitistic entailments are investigated. The purpose of the paper is to prove three theorems: Theorem I.7, being the counterpart of the main theorem from Czelakowski [3], and Theorems II.2 and III.2 being the entailment counterparts of Bloom's results [1]. Theorem I.7 states that if a classK of matrices is adequate for , thenMatr( ) is the least class of matrices containingK and closed under the formation of ultraproducts, submatrices, strict homomorphisms and strict homomorphic pre-images. Theorem II.2 in Section II gives sufficient and necessary conditions for a structural entailment to be finitistic. Section III contains theorems which characterize finitely based entailments.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
58 (#369,480)

6 months
17 (#173,529)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Multiple Conclusion Logic.D. J. Shoesmith & Timothy John Smiley - 1978 - Cambridge, England / New York London Melbourne: Cambridge University Press. Edited by T. J. Smiley.
Equivalential logics.Janusz Czelakowski - 1981 - Studia Logica 40 (3):227-236.
Equivalential logics (II).Janusz Czelakowski - 1981 - Studia Logica 40 (4):355 - 372.

View all 8 references / Add more references