A theorem on strongly finite propositional calculi

Bulletin of the Section of Logic 4 (1):2-6 (1975)
  Copy   BIBTEX

Abstract

I shall assume that the reader is familiar with the notions dened in [2] and [3]. A consequence C dened over a propositional language L will be said to be d-structural i the consequence dC dual with respect to C is structural. The following propositions holds true

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

More about referential matrices.Ryszard Wójcicki - 1980 - Bulletin of the Section of Logic 9 (2):93-96.
Quasi-strongly Finite Sentential Calculi.Zdzislaw Dywan - 1980 - Bulletin of the Section of Logic 9 (4):154-157.
Decidability of structural completeness for strongly finite propositional calculi.Zdzislaw Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
Decidability of structural completeness for strongly finite propositional calculi.Zdzis law Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
The degrees of maximality of the intuitionistic propositional logic and of some of its fragments.Wieslaw Dziobiak - 1980 - Bulletin of the Section of Logic 9 (3):136-139.
On two notions concerning the structural sentential calculi.Wieslaw Dziobiak & Wojciech Sachwanowicz - 1979 - Bulletin of the Section of Logic 8 (2):54-58.
Connections between some notions of completeness of structural propositional calculi.Marek Tokarz - 1972 - Bulletin of the Section of Logic 1 (2):17-19.

Analytics

Added to PP
2014-02-19

Downloads
23 (#928,616)

6 months
4 (#1,232,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references