default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 45
Volume 45, Number 1, 10 November 1989
- Richard Beigel, William I. Gasarch:
On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case. 1-38 - Hans-Dieter Donder, Jean-Pierre Levinski:
Some Principles Related to Chang's Conjecture. 39-101
Volume 45, Number 2, 12 December 1989
- John T. Baldwin, Annalisa Marcja:
Papers presented at the Meeting on "Stability in Model Theory II", July 13-17, 1987, Trento, Italy - Preface. Ann. Pure Appl. Log. 45(2): 103 (1989) - John T. Baldwin, Anand Pillay:
Semisimple Stable and Superstable Groups. 105-127 - Elisabeth Bouscaren:
Elementary Pairs of Models. 129-137 - Ehud Hrushovski:
Almost Orthogonal Regular Types. 139-155 - Ehud Hrushovski, Saharon Shelah
:
A Dichotomy Theorem for Regular Types. 157-169 - Françoise Point:
Groups with Identities. 171-188 - Lou van den Dries:
Dimension of Definable Sets, Algebraic Boundedness and Henselian Fields. 189-209
Volume 45, Number 3, 20 December 1989
- Miklós Ajtai:
First-Order Definability on Finite Structures. 211-225 - Richard Beigel, William I. Gasarch:
On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case. 227-246 - Peter Lars Dordal:
Towers in omegaomega and omega omega. 247-276 - Saharon Shelah, Steven Buechler:
On the Existence of Regular Types. 277-308
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.
last updated on 2026-08-06 22:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
