The infinite injury priority method

Journal of Symbolic Logic 41 (2):513-530 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272252

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Persons with adult-onset head injury: A crucial resource for feminist philosophers.Kate Lindemann - 2001 - Hypatia 16 (4):105-123.
An α-finite injury method of the unbounded type.C. T. Chong - 1976 - Journal of Symbolic Logic 41 (1):1-17.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
Σ2 Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator.C. T. Chong & Yue Yang - 1998 - Journal of Symbolic Logic 63 (3):797 - 814.
A causal model for causal priority.Martin Bunzl - 1984 - Erkenntnis 21 (1):31 - 44.
Worlds apart: On the possibility of an actual infinity.Josh Dever - unknown
Tableaux for łukasiewicz infinite-valued logic.Nicola Olivetti - 2003 - Studia Logica 73 (1):81 - 111.
Shaping Biomedical Research Priorities: The Case of the National Institutes of Health. [REVIEW]Daniel Callahan - 1999 - Health Care Analysis 7 (2):115-129.
The method of infinite descent and the method of mathematical induction.Harriet F. Montague - 1944 - Philosophy of Science 11 (3):178-185.

Analytics

Added to PP
2009-01-28

Downloads
246 (#79,259)

6 months
10 (#251,846)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
A Refinement of Low n_ and High _n for the R.E. Degrees.Jeanleah Mohrherr - 1986 - Mathematical Logic Quarterly 32 (1-5):5-12.

View all 11 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.

Add more references