default search action
Annals of Pure and Applied Logic, Volume 142
Volume 142, Numbers 1-3, October 2006
- Georg Moser:
Ackermann's substitution method (remixed). 1-18 - Krzysztof Krupinski:
Profinite structures interpretable in fields. 19-54 - James Cummings, Matthew Foreman, Menachem Magidor:
Canonical structure in the universe of set theory: part two. 55-75 - Greg Piper:
Square and non-reflection in the context of Pk lambda. 76-97 - David Asperó:
Coding by club-sequences. 98-114 - Ziv Shami:
On analyzability in the forking topology for simple theories. 115-124 - Makoto Kanazawa:
Computing interpolants in implicational logics. 125-201 - Ottavio M. D'Antona, Vincenzo Marra:
Computing coproducts of finitely presented Gödel algebras. 202-211 - Jean-Marc Andreoli, Roberto Maieli, Paul Ruet:
Non-commutative proof construction: A constraint-based approach. 212-244 - David Gabelaia, Agi Kurucz, Frank Wolter, Michael Zakharyaschev:
Non-primitive recursive decidability of products of modal logics with expanding domains. 245-268 - Matthias Baaz, Rosalie Iemhoff:
The Skolemization of existential quantifiers in intuitionistic logic. 269-295 - Elisabeth Bouscaren, Ehud Hrushovski:
Classifiable theories without finitary invariants. 296-320 - Achim Blumensath:
A model-theoretic characterisation of clique width. 321-350 - Abderezak Ould Houcine:
Satisfaction of existential theories in finitely presented groups and some embedding theorems. 351-365 - Emil Jerábek:
Frege systems for extensible modal logics. 366-379 - Sakaé Fuchino, Noam Greenberg, Saharon Shelah:
Models of real-valued measurability. 380-397 - Tetsuya Ishiu:
The saturation of club guessing ideals. 398-424 - Pandelis Dodos:
Codings of separable compact subsets of the first Baire class. 425-441
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.