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

Reprint years

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,756

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.Wieslaw Dziobiak - 1980 - Bulletin of the Section of Logic 9 (3):136-139.
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.
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.
Avoiding uniformity in the Δ 2 0 enumeration degrees.Liliana Badillo & Charles M. Harris - 2014 - Annals of Pure and Applied Logic 165 (9):1355-1379.
On the degree of complexity of sentential logics. A couple of examples.Jacek Hawranek & Jan Zygmunt - 1981 - Studia Logica 40 (2):141 - 153.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Degree spectra of relations on structures of finite computable dimension.Denis R. Hirschfeldt - 2002 - Annals of Pure and Applied Logic 115 (1-3):233-277.
Density results in the Δ 2 0 e-degrees.Marat M. Arslanov, Iskander Sh Kalimullin & Andrea Sorbi - 2001 - Archive for Mathematical Logic 40 (8):597-614.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.

Analytics

Added to PP
2014-02-19

Downloads
21 (#1,114,060)

6 months
1 (#1,604,333)

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