Almost complemented Π0 1 classes

Archive for Mathematical Logic 45 (5):555-568 (2006)
  Copy   BIBTEX

Abstract

We explore an analogue of major subset for Π0 1 classes, which leads to the definition and characterization of almost complemented Π0 1 classes

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-005-0293-z

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Minimal extensions of Π01 classes.Douglas Cenzer & Farzan Riazati - 2005 - Mathematical Logic Quarterly 51 (2):206-216.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Tarski and Proper Classes.Philip Hugly & Charles Sayward - 1980 - Analysis 40 (4):6-11.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Elementary classes in basic modal logic.Holger Sturm - 2000 - Studia Logica 64 (2):193-213.
The $\mu$ -measure as a tool for classifying computational complexity.Karl-Heinz Niggl - 2000 - Archive for Mathematical Logic 39 (7):515-539.
Sets and classes as many.John L. Bell - 2000 - Journal of Philosophical Logic 29 (6):585-601.
Plural quantification and classes.Gabriel Uzquiano - 2003 - Philosophia Mathematica 11 (1):67-81.
Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..
Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: Cambridge University Press.
Characterizations of negative definability in modal logic.Marco Hollenberg - 1998 - Studia Logica 60 (3):357-386.

Analytics

Added to PP
2013-11-23

Downloads
13 (#978,482)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Choice classes.Ahmet Çevik - 2016 - Mathematical Logic Quarterly 62 (6):563-574.
Minimal extensions of Π01 classes.Douglas Cenzer & Farzan Riazati - 2005 - Mathematical Logic Quarterly 51 (2):206-216.

Add more citations

References found in this work

No references found.

Add more references