- 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
Permitting, forcing, and copying of a given recursive relation
Annals of Pure and Applied Logic 86 (3):219-236 (1997)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas.Christopher J. Ash & Julia F. Knight - 1994 - Mathematical Logic Quarterly 40 (2):173-181.
Recursive versus recursively enumerable binary relations.Dev K. Roy - 1993 - Studia Logica 52 (4):587 - 593.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
Sweet & sour and other flavours of ccc forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (5):583-663.
Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L.Gunter Fuchs & Joel David Hamkins - 2008 - Journal of Symbolic Logic 73 (2):614 - 633.
Forcing operators on MTL-algebras.George Georgescu & Denisa Diaconescu - 2011 - Mathematical Logic Quarterly 57 (1):47-64.
Intentions, Intentionally Permitting, and the Problem of Evil.T. Ryan Byerly - 2011 - Proceedings of the American Catholic Philosophical Association 85:223-236.
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Analytics
Added to PP
2014-01-16
Downloads
17 (#871,044)
6 months
1 (#1,475,085)
2014-01-16
Downloads
17 (#871,044)
6 months
1 (#1,475,085)
Historical graph of downloads
Citations of this work
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.
Degree spectra of relations on computable structures.Denis R. Hirschfeldt - 2000 - Bulletin of Symbolic Logic 6 (2):197-212.
Degree spectra of intrinsically C.e. Relations.Denis R. Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
Degree spectra of relations on structures of finite computable dimension.Denis R. Hirschfeldt - 2002 - Annals of Pure and Applied Logic 115 (1-3):233-277.
Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms.Denis R. Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697 - 720.
References found in this work
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
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.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Intrinsically< i> gs_;< sup> 0< sub> alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
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-5ff6c685cb-rv6xt uwo