On the degree of matrix complexity of Johansson's minimal logic

Bulletin of the Section of Logic 13 (1):50-52 (1984)
  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: 91,202

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, III. An example of Johansson's minimal logic.Jacek Hawranek - 1987 - Studia Logica 46 (4):283 - 289.
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 Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
El sistema bp+ : Una lógica positiva mínima para la negación mínima (the system bp+: A minimal positive logic for minimal negation).José M. Méndez, Francisco Salto & Gemma Robles - 2007 - Theoria 22 (1):81-91.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Minimal Complements for Degrees below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
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.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
A Minimal Degree Which Collapses $omega_1$.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298-300.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.

Analytics

Added to PP
2014-01-25

Downloads
19 (#753,814)

6 months
2 (#1,157,335)

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