- 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
Quasi-simple relations in copies of a given recursive structure
Annals of Pure and Applied Logic 86 (3):203-218 (1997)
Abstract
This article has no associated abstract. (fix it)DOI
10.1016/s0168-0072(97)00010-9
My notes
Similar books and articles
Models for prediction, explanation and control: recursive bayesian networks.Jon Williamson - 2011 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 26 (1):5-33.
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas.Christopher J. Ash & Julia F. Knight - 1994 - Mathematical Logic Quarterly 40 (2):173-181.
Possible degrees in recursive copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Recursive Bayesian Nets for Prediction, Explanation and Control in Cancer Science.Jon Williamson - unknown
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
A semantical investigation into leśniewski's axiom of his ontology.Mitio Takano - 1985 - Studia Logica 44 (1):71 - 77.
Recursive versus recursively enumerable binary relations.Dev K. Roy - 1993 - Studia Logica 52 (4):587 - 593.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
On Lovely Pairs and the (∃ y ∈ P ) Quantifier.Anand Pillay & Evgueni Vassiliev - 2005 - Notre Dame Journal of Formal Logic 46 (4):491-501.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Analytics
Added to PP
2014-01-16
Downloads
17 (#648,802)
6 months
1 (#485,467)
2014-01-16
Downloads
17 (#648,802)
6 months
1 (#485,467)
Historical graph of downloads
Citations of this work
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
References found in this work
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Some effects of Ash–Nerode and other decidability conditions on degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 55 (1):51-65.
Automorphisms of supermaximal subspaces.R. G. Downey & G. R. Hird - 1985 - Journal of Symbolic Logic 50 (1):1-9.
Automorphisms of substructure lattices in recursive algebra.David R. Guichard - 1983 - Annals of Pure and Applied Logic 25 (1):47-58.
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-9c67bdf98-7wpfk N