Some examples concerning uniformity and complexity of sentential logics

Bulletin of the Section of Logic 9 (2):71-72 (1980)
  Copy   BIBTEX


This abstract is a contribution to the paper by R. Wojcicki [2]. We use the terminology introduced there, . In this note we show that 1 0 For each n 2 there exists a logic whose degree of uniformity and degree of complexity are both equal to n. 2 0 There is a logic with the degree of uniformity equal to 2 @0 but with the degree of complexity equal to @0



    Upload a copy of this work     Papers currently archived: 86,468

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

Categorical Abstract Algebraic Logic: Models of π-Institutions.George Voutsadakis - 2005 - Notre Dame Journal of Formal Logic 46 (4):439-460.
Categorical Abstract Algebraic Logic: More on Protoalgebraicity.George Voutsadakis - 2006 - Notre Dame Journal of Formal Logic 47 (4):487-514.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Filter distributive logics.Janusz Czelakowski - 1984 - Studia Logica 43 (4):353 - 377.


Added to PP

15 (#777,086)

6 months
1 (#870,792)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Add more references