![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Annals of Pure and Applied Logic, Volume 134
Volume 134, Number 1, June 2005
- Ruy J. G. B. de Queiroz, Bruno Poizat, Sergei N. Artëmov:
WoLLIC'2002. 1-4 - Mauricio Ayala-Rincón
, Flávio L. C. de Moura
, Fairouz Kamareddine:
Comparing and implementing calculi of explicit substitutions with eta-reduction. 5-41 - Ricardo Bianconi
:
Undefinability results in o-minimal expansions of the real numbers. 43-51 - Felipe Cucker
:
On sparseness, reducibilities, and complexity. 53-61 - Mauricio Osorio, Juan Antonio Navarro Pérez, José Arrazola:
Safe beliefs for propositional theories. 63-82 - Rohit Parikh, Jouko A. Väänänen
:
Finite information logic. 83-93
Volume 134, Numbers 2-3, July 2005
- Benno van den Berg:
Inductive types and exact completion. 95-121 - Samson Abramsky
, Marina Lenisa:
Linear realizability and full completeness for typed lambda-calculi. 122-168 - Thomas Blossier:
Subgroups of the additive group of a separably closed field. 169-216 - Olivier Laurent, Myriam Quatrini, Lorenzo Tortora de Falco
:
Polarized and focalized linear and classical proofs. 217-264 - Andrew M. W. Glass, Angus Macintyre, Françoise Point:
Free abelian lattice-ordered groups. 265-283 - Thomas Studer
:
Explicit mathematics: power types and overloading. 284-302 - Alessandro Berarducci
, Margarita Otero
, Ya'acov Peterzil, Anand Pillay:
A descending chain condition for groups definable in o-minimal structures. 303-313
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.