Permitting, forcing, and copying of a given recursive relation

Annals of Pure and Applied Logic 86 (3):219-236 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,271

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

In praise of copying.Marcus Boon - 2010 - Cambridge, Mass.: Harvard University Press.
Action and ethics education.Robert Liebler - 2010 - Journal of Academic Ethics 8 (2):153-160.
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.
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.
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 (#830,461)

6 months
1 (#1,499,687)

Historical graph of downloads
How can I increase my downloads?

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.
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.

View all 6 references / Add more references