- 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
Bounding minimal pairs
Journal of Symbolic Logic 44 (4):626-642 (1979)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
Bounding and nonbounding minimal pairs in the enumeration degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741-766.
Review: Michael Morley, Countable Models of $aleph_1$-Categorical Theories; J. T. Baldwin, A. H. Lachlan, On Strongly Minimal Sets. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Lachlan A. H.. Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society, set. 3 vol. 16 part 3 , pp. 537–569. [REVIEW]Carl G. Jockosch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
Michael Morley. Countable models of ℵ1-categorical theories. Israel journal of mathematics, vol. 5 , pp. 65–72. - J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. The journal of symbolic logic, vol. 36 ,pp. 79–96. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.
Review: A. H. Lachlan, On Countable Stable Structures which are Homogeneous for a Finite Relational Language; G. Cherlin, A. H. Lachlan, Stable Finitely Homogeneous Structures. [REVIEW]Dugald Macpherson - 1993 - Journal of Symbolic Logic 58 (1):350-352.
Review: A. H. Lachlan, Recursive Real Numbers. [REVIEW]Paul Axt - 1965 - Journal of Symbolic Logic 30 (2):256-256.
Review: A. H. Lachlan, A Note on Universal Sets. [REVIEW]P. R. Young - 1967 - Journal of Symbolic Logic 32 (3):395-395.
Analytics
Added to PP
2009-01-28
Downloads
37 (#444,844)
6 months
9 (#355,272)
2009-01-28
Downloads
37 (#444,844)
6 months
9 (#355,272)
Historical graph of downloads
Citations of this work
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.
Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
The recursively enumerable degrees have infinitely many one-types.Klaus Ambos-Spies & Robert I. Soare - 1989 - Annals of Pure and Applied Logic 44 (1-2):1-23.
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-68866f4b87-sz9d2 uwo