


default search action
Annals of Pure and Applied Logic, Volume 94
Volume 94, Number 1-3, 5 October 1998
- Arnold Beckmann

, Wolfram Pohlers:
Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. 7-19 - Douglas A. Cenzer, Jeffrey B. Remmel:

Feasible Graphs with Standard Universe. 21-35 - Peter Cholak:

The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. 37-44 - Rodney G. Downey, Richard A. Shore:

Splitting Theorems and the Jump Operator. 45-52 - Peter A. Fejer:

Lattice Representations for Computability Theory. 53-74 - Sergei S. Goncharov:

Decidable Boolean Algebras of Low Level. 75-95 - Leo Harrington, Robert I. Soare:

Definable Properties of the Computably Enumerable Sets. 97-125 - Julia F. Knight:

Coding a Family of Sets. 127-142 - Manuel Lerman:

A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. 143-180 - Michael Rathjen, Edward R. Griffor, Erik Palmgren:

Inaccessibility in Constructive Set Theory and Type Theory. 181-200 - Helmut Schwichtenberg:

Finite Notations for Infinite Terms. 201-222 - Alexandra Shlapentokh:

Weak Presentations of Non-Finitely Generated Fields. 223-252 - Theodore A. Slaman, W. Hugh Woodin:

Extending Partial Orders to Dense Linear Orders. 253-261 - Andrea Sorbi:

Sets of Generators and Automorphism Bases for the Enumeration Degrees. 263-272 - Frank Stephan

:
Learning via Queries and Oracles. 273-296

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














