- 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
Recursion theory on algebraic structures with independent sets
Annals of Mathematical Logic 18 (2):153 (1980)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Recursively invariant beta-recursion theory.Wolfgand Maass - 1981 - Annals of Mathematical Logic 21 (1):27.
Admissible sets and the saturation of structures.Alan Adamson - 1978 - Annals of Mathematical Logic 14 (2):111.
Two splitting theorems for beta-recursion theory.Steven Homer - 1980 - Annals of Mathematical Logic 18 (2):137.
Sets, models and recursion theory.John N. Crossley (ed.) - 1967 - Amsterdam,: North-Holland Pub. Co..
A guide to the identification of admissible sets above structures.John S. Schlipf - 1977 - Annals of Mathematical Logic 12 (2):151.
Expansions of o-minimal structures by dense independent sets.Alfred Dolich, Chris Miller & Charles Steinhorn - 2016 - Annals of Pure and Applied Logic 167 (8):684-706.
Splittings of effectively speedable sets and effectively levelable sets.Roland S. H. Omanadze - 2004 - Journal of Symbolic Logic 69 (1):143-158.
Analytics
Added to PP
2014-01-17
Downloads
14 (#1,278,375)
6 months
4 (#1,249,987)
2014-01-17
Downloads
14 (#1,278,375)
6 months
4 (#1,249,987)
Historical graph of downloads
Citations of this work
Classifications of degree classes associated with r.e. subspaces.R. G. Downey & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 42 (2):105-124.
First-order theories of abstract dependence relations.John T. Baldwin - 1984 - Annals of Pure and Applied Logic 26 (3):215-243.
Undecidability of L(F∞) and other lattices of r.e. substructures.R. G. Downey - 1986 - Annals of Pure and Applied Logic 32:17-26.
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
References found in this work
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Creative sets.John Myhill - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (2):97-108.
Recursion Theory and Algebra.G. Metakides, A. Nerode, J. N. Crossley, Iraj Kalantari & Allen Retzlaff - 1986 - Journal of Symbolic Logic 51 (1):229-232.
Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces.Iraj Kalantari & Allen Retzlaff - 1977 - Journal of Symbolic Logic 42 (4):481-491.
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-667477cd97-wmc4m dc2