- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Maximal Arithmetical Reducibilities
Mathematical Logic Quarterly 20 (13‐18):261-270 (1974)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Baire reductions and good Borel reducibilities.Luca Motto Ros - 2010 - Journal of Symbolic Logic 75 (1):323-345.
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities.Y. Wang & W. Merkle - 2001 - Mathematical Logic Quarterly 47 (2):249-270.
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
Automorphisms with only infinite orbits on non-algebraic elements.Grégory Duby - 2003 - Archive for Mathematical Logic 42 (5):435-447.
Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Maximal-Element Rationalizability.Walter Bossert, Yves Sprumont & Kotaro Suzumura - 2005 - Theory and Decision 58 (4):325-350.
Review: N. A. Sanin, Some Operations on Logico-Arithmetical Formulas; N. A. Sanin, On Imbeddings of the Classical Logico-Arithmetical Calculus into the Constructive Logico-Arithmetical Calculus. [REVIEW]Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (4):297-298.
The priority of arithmetical truth over arithmetical provability.Enrico Martino - 2002 - Topoi 21 (1-2):55-63.
The maximal linear extension theorem in second order arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
Analytics
Added to PP
2013-11-24
Downloads
8 (#1,283,306)
6 months
1 (#1,533,009)
2013-11-24
Downloads
8 (#1,283,306)
6 months
1 (#1,533,009)
Historical graph of downloads
Citations of this work
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo