


default search action
Annals of Pure and Applied Logic, Volume 31
Volume 31, 1986
- Rodney G. Downey:
Sound, totally sound, and unsound recursive equivalence types. 1-20 - Leon Henkin, J. Donald Monk, Alfred Tarski:
Representable cylindric algebras. 23-60 - H. Jerome Keisler:
A completeness proof for adapted probability logic. 61-70 - H. Jerome Keisler:
Hyperfinite models of adapted probability logic. 71-86 - Gerald E. Sacks:
The limits of E-recursive enumerability. 87-120 - Mark Tamthai:
Preface. 121 - Douglas K. Brown, Stephen G. Simpson
:
Which set existence axioms are needed to prove the separable Hahn-Banach theorem? 123-144 - Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer:
Members of countable π10 classes. 145-163 - C. T. Chong:
1-Generic degrees and minimal degrees in higher recursion theory, II. 165-175 - Philip T. Cox, Tomasz Pietrzykowski:
Incorporating equality into logic programming via surface deduction. 177-189 - John N. Crossley, Alfred B. Manaster, Michael F. Moses:
Recursive categoricity and recursive stability. 191-204 - Rodney G. Downey, Michael Stob:
Structural interactions of the recursively enumerable T- and W-degrees. 205-236 - Reijiro Kurata:
Paris-Harrington principles, reflection principles and transfinite induction up to ε0. 237-256 - Anil Nerode, Jeffrey B. Remmel:
Generic objects in recursion theory II: Operations on recursive approximation spaces. 257-288 - Stephen G. Simpson
, Rick L. Smith:
Factorization of polynomials and Σ10 induction. 289-306 - Gaisi Takeuti, Satoko Titani:
Global intuitionistic analysis. 307-339

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.