Iterated trees of strategies and priority arguments

Archive for Mathematical Logic 36 (4-5):297-312 (1997)
  Copy   BIBTEX


. We describe the motivation for the construction of a general framework for priority arguments, the ideas incorporated into the construction of the framework, and the use of the framework to prove theorems in computability theory which require priority arguments.



    Upload a copy of this work     Papers currently archived: 76,419

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

A general framework for priority arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.
A Framework for Priority Arguments.Manuel Lerman - 2010 - Cambridge University Press.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Modelling reciprocal altruism.Christopher Stephens - 1996 - British Journal for the Philosophy of Science 47 (4):533-551.


Added to PP

34 (#346,015)

6 months
1 (#452,962)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.

Add more references