Annals of Pure and Applied Logic

Title Publication Date Language Citations
Type theories, toposes and constructive set theory: predicative aspects of AST2002/04/01English
The complexity of the disjunction and existential properties in intuitionistic logic1999/08/01English
Fixed point theory in weak second-order arithmetic1990/05/01English
On the computational content of intuitionistic propositional proofs2001/05/01English
Index2000/11/01English
The name for Kojman–Shelah collapsing function2001/05/01English
A classical view of the intuitionistic continuum1996/09/01English
Editorial board1993/06/01English
Strong splitting in stable homogeneous models2000/05/01English
Locally finite weakly minimal theories1991/12/01English
On a finitary version of mathematical analysis2001/12/01English
Fixed points and unfounded chains2001/05/01English
Systems of combinatory logic related to predicative and ‘mildly impredicative’ fragments of Quine's ‘New Foundations’1993/01/01English
Modules in the category of sheaves over quantales2001/03/01English
Effective forcing versus proper forcing1996/09/01English
Some purely topological models for intuitionistic analysis1999/06/01English
Projective uniformization revisited2000/05/01English
Strong normalization in type systems: A model theoretical approach1995/05/01English
The Manin–Mumford conjecture and the model theory of difference fields2001/09/01English
A general theory of confluent rewriting systems for logic programming and its applications2001/03/01English
Three clouds may cover the plane2001/05/01English
Hyperarithmetical relations in expansions of recursive structures1994/03/01English
An Omitting Types Theorem for positive bounded formulas in normed spaces2001/03/01English
Constructive compact operators on a Hilbert space1991/04/01English
A contribution to the end-extension problem and the Π1 conservativeness problem1993/05/01English
Index2000/07/01English
Undecidability and 1-types in intervals of the computably enumerable degrees2000/12/01English
Some orbits for E2001/01/01English
Analyzing realizability by Troelstra's methods2002/04/01English
A strong normalization result for classical logic1995/12/01English