Iterated trees of strategies and priority arguments
Archive for Mathematical Logic 36 (4-5):297-312 (1997)
Abstract
. 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.DOI
10.1007/s001530050067
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A general framework for priority arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.
Three Approaches to Iterated Belief Contraction.Raghav Ramachandran, Abhaya C. Nayak & Mehmet A. Orgun - 2012 - Journal of Philosophical Logic 41 (1):115-142.
Iterated Modalities, Meaning and A Priori Knowledge.Dominic Gregory - 2011 - Philosophers' Imprint 11.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
Satisfiability Testing for Boolean Formulas Using Δ-Trees.G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
On the Epistemic Foundation for Iterated Weak Dominance: An Analysis in a Logic of Individual and Collective attitudes.Emiliano Lorini - 2013 - Journal of Philosophical Logic 42 (6):863-904.
Modelling reciprocal altruism.Christopher Stephens - 1996 - British Journal for the Philosophy of Science 47 (4):533-551.
Exploitation and peacekeeping: introducing more sophisticated interactions to the iterated prisoner's dilemma.Toby Ord & Alan Blair - 2002 - World Congress on Computational Intelligence:1-6.
The Measurement of Ranks and the Laws of Iterated Contraction.Wolfgang Spohn & Matthias Hild - 2008 - Artificial Intelligence 172 (10):1195-1218.
Analytics
Added to PP
2013-10-30
Downloads
34 (#346,015)
6 months
1 (#452,962)
2013-10-30
Downloads
34 (#346,015)
6 months
1 (#452,962)
Historical graph of downloads
Citations of this work
Turing reducibility in the fine hierarchy.Alexander G. Melnikov, Victor L. Selivanov & Mars M. Yamaleev - 2020 - Annals of Pure and Applied Logic 171 (7):102766.
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.
The existential theory of the poset of R.e. Degrees with a predicate for single jump reducibility.Steffen Lempp & Manuel Lerman - 1992 - Journal of Symbolic Logic 57 (3):1120-1130.
