Some examples concerning uniformity and complexity of sentential logics

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

Abstract

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

Categories

Keywords

Links

PhilArchive



    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

My notes

Similar books and articles

On the degree of complexity of sentential logics. A couple of examples.Jacek Hawranek & Jan Zygmunt - 1981 - Studia Logica 40 (2):141 - 153.
On the degree of complexity of sentential logics.II. An example of the logic with semi-negation.Jacek Hawranek & Jan Zygmunt - 1984 - Studia Logica 43 (4):405 - 413.
A theorem of the degree of complexity of some sentential logics.Jacek Hawranek & Jan Zygmunt - 1980 - Bulletin of the Section of Logic 9 (2):67-69.
On the degree of complexity of sentential logics, III. An example of Johansson's minimal logic.Jacek Hawranek - 1987 - Studia Logica 46 (4):283 - 289.
Categorical Abstract Algebraic Logic: Models of π-Institutions.George Voutsadakis - 2005 - Notre Dame Journal of Formal Logic 46 (4):439-460.
Leibniz filters and the strong version of a protoalgebraic logic.Josep Maria Font & Ramon Jansana - 2001 - Archive for Mathematical Logic 40 (6):437-465.
Number of non-Fregean sentential logics that have adequate models.Joanna Golińska-Pilarek - 2006 - Mathematical Logic Quarterly 52 (5):439–443.
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.
Computing with cylindric modal logics and arrow logics, lower Bounds.Maarten Marx - 2002 - Studia Logica 72 (2):233-252.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Effects of syntactic complexity on processing and retrieval of sentential constituents.Betty J. Haslett - 1973 - Journal of Experimental Psychology 100 (2):419.
Sentential logics and Maehara interpolation property.Janusz Czelakowski - 1985 - Studia Logica 44 (3):265 - 283.
Filter distributive logics.Janusz Czelakowski - 1984 - Studia Logica 43 (4):353 - 377.

Analytics

Added to PP
2014-02-19

Downloads
15 (#777,086)

6 months
1 (#870,792)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references