Annals of Pure and Applied Logic

7	--	19	Arnold Beckmann, Wolfram Pohlers. Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory
21	--	35	Douglas A. Cenzer, Jeffrey B. Remmel. Feasible Graphs with Standard Universe
37	--	44	Peter Cholak. The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets
45	--	52	Rodney G. Downey, Richard A. Shore. Splitting Theorems and the Jump Operator
53	--	74	Peter A. Fejer. Lattice Representations for Computability Theory
75	--	95	Sergei S. Goncharov. Decidable Boolean Algebras of Low Level
97	--	125	Leo Harrington, Robert I. Soare. Definable Properties of the Computably Enumerable Sets
127	--	142	Julia F. Knight. Coding a Family of Sets
143	--	180	Manuel Lerman. A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees
181	--	200	Michael Rathjen, Edward R. Griffor, Erik Palmgren. Inaccessibility in Constructive Set Theory and Type Theory
201	--	222	Helmut Schwichtenberg. Finite Notations for Infinite Terms
223	--	252	Alexandra Shlapentokh. Weak Presentations of Non-Finitely Generated Fields
253	--	261	Theodore A. Slaman, W. Hugh Woodin. Extending Partial Orders to Dense Linear Orders
263	--	272	Andrea Sorbi. Sets of Generators and Automorphism Bases for the Enumeration Degrees
273	--	296	Frank Stephan. Learning via Queries and Oracles

External Links