Common logic of binary connectives has finite maximality degree (preliminary report)

Bulletin of the Section of Logic 19 (2):36-38 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

The degrees of maximality of the intuitionistic propositional logic and of some of its fragments.Wiesław Dziobiak - 1981 - Studia Logica 40 (2):195 - 198.
Degrees of maximality of Łukasiewicz-like sentential calculi.Grzegorz Malinowski - 1977 - Studia Logica 36 (3):213 - 228.
A strongly finite logic with infinite degree of maximality.Marek Tokarz - 1976 - Studia Logica 35 (4):447 - 451.
Common Logic of 2‐Valued Semigroup Connectives.Wolfgang Rautenberg - 1991 - Mathematical Logic Quarterly 37 (9‐12):187-192.
Degree of maximality versus degree of completeness.Ryszard Wójcicki - 1974 - Bulletin of the Section of Logic 3 (2):41-43.
On Combined Connectives.A. Sernadas, C. Sernadas & J. Rasga - 2011 - Logica Universalis 5 (2):205-224.
The lattice of normal modal logics (preliminary report).Wolfgang Rautenberg - 1977 - Bulletin of the Section of Logic 6 (4):193-199.
Some properties of the hierarchy of modal logics (preliminary report).Wolfgang Rautenberg - 1976 - Bulletin of the Section of Logic 5 (3):103-104.
An example of strongly finite consequence operation with 2ℵ0 standard strengthenings.Wies?aw Dziobiak - 1980 - Studia Logica 39 (4):375 - 379.
Binary connectives functionally complete by themselves in s5 modal logic.Gerald J. Massey - 1967 - Journal of Symbolic Logic 32 (1):91-92.
Notes on Gibbard's theorem.Branden Fitelson - manuscript
SN and {CR} for free-style {${bf LK}sp {tq}$}: linear decorations and simulation of normalization.Jean-Baptiste Joinet, Harold Schellinx & Lorenzo Tortora de Falco - 2002 - Journal of Symbolic Logic 67 (1):162-196.
Axiomatization of semigroup consequences.Wolfgang Rautenberg - 1989 - Archive for Mathematical Logic 29 (2):111-123.
Binary Relations: Finite Characterizations and Computational Complexity. [REVIEW]Vicki Knoblauch - 2008 - Theory and Decision 65 (1):27-44.

Analytics

Added to PP
2014-01-23

Downloads
25 (#651,290)

6 months
5 (#703,779)

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

No references found.

Add more references