On the degree of matrix complexity

Bulletin of the Section of Logic 13 (2):50-52 (1984)
  Copy   BIBTEX

Abstract

This is an abstract of the author’s dissertation written originally in Polish – its full version will appear in Acta Universitatis Wraticlaviensis. This paper is a contribution to the subject of matrix semantics, as originally presented by Lo´s and Suszko [2] and developed by W´ojcicki [3], [4]. By sentential logics we shall understand any pair , where C is a consequence operation on a sentential language L and: 1 o L is an absolutely free algebra of formulas generated by a denumerable set of sentential variables, 2 o C is structural, that is eC ⊆ C for all X ⊆ L and e ∈ End

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,317

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the degree of matrix complexity of Johansson's minimal logic.Jacek Hawranek - 1984 - Bulletin of the Section of Logic 13 (1):50-52.
Algebraic aspects of deduction theorems.Janusz Czelakowski - 1983 - Bulletin of the Section of Logic 12 (3):111-114.
Quasi-strongly Finite Sentential Calculi.Zdzislaw Dywan - 1980 - Bulletin of the Section of Logic 9 (4):154-157.
Notes on the semantics for the logic with semi-negation.Jacek Hawranek & Jan Zygmunt - 1983 - Bulletin of the Section of Logic 12 (4):152-155.
More about referential matrices.Ryszard Wójcicki - 1980 - Bulletin of the Section of Logic 9 (2):93-96.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references