default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 31
Volume 31, Number 1, January 1991
- Gabriele Marongiu, Sauro Tulipani:
Quantifier elimination for infinite terms. 1-17 - S. Barry Cooper:
The density of the low2n-r.e. degrees. 19-24 - Saharon Shelah
:
Reflecting stationary sets and successors of singular cardinals. 25-53 - Daniel Lascar:
Les beaux automorphismes. 55-68 - Andrea Cantini:
A logic of abstraction related to finite constructive number classes. 69-83
Volume 31, Number 2, March 1991
- Andreas Weiermann:
Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. 85-94 - Annalisa Marcja, Mike Prest, Carlo Toffalori:
Classification theory for abelian groups with an endomorphism. 95-104 - Jaap van Oosten:
A semantical proof of De Jongh's theorem. 105-114 - Gisela Ahlbrandt, Martin Ziegler:
What's so special about (Z/4Z)ω? 115-132 - Michel Hébert:
Syntactic characterization of closure under connected limits. 133-143
Volume 31, Number 3, May 1992
- Haim Judah, Arnold W. Miller, Saharon Shelah:
Sacks forcing, Laver forcing, and Martin's axiom. 145-161 - Anand Pillay:
Countable models of 1-based theories. 163-169 - Daniel Dzierzgowski:
Intuitionistic typical ambiguity. 171-182 - Jeffry L. Hirst:
Connected components of graphs and reverse mathematics. 183-192 - Tapani Hyttinen:
Onκ-complete reduced products. 193-199 - Arthur W. Apter:
Some new upper bounds in consistency strength for certain choiceless large cardinal patterns. 201-205 - Shmuel Lifsches, Saharon Shelah:
The monadic theory of (ω2, <) may be complicated. 207-213 - C. Ward Henson:
Strong counterexamples to Borel hyperdeterminacy. 215-220
Volume 31, Number 4, July 1992
- Tomek Bartoszynski, Saharon Shelah:
Intersection of ultrafilters may have measure zero. 221-226 - Ulrich Kohlenbach:
Pointwise hereditary majorization and some applications. 227-241 - Marcus Kracht:
Even more about the lattice of tense logics. 243-257 - Stanislaw Krajewski:
Note on grammatical translations of logical calculi. 259-262 - Roger Villemaire:
Completely decomposable abelian groups -categorical over a subgroup. 263-275 - Alistair H. Lachlan, Richard A. Shore:
Then-rea enumeration degrees are dense. 277-285 - Thomas G. McLaughlin:
Recursive ultrapowers, simple models, and cofinal extensions. 287-296
Volume 31, Number 5, September 1992
- Bernhard Herwig, James G. Loveys, Anand Pillay, Predrag Tanovic, O. Wagner:
Stable theories without dense forking chains. 297-303 - Ulrich Kohlenbach:
Remarks on Herbrand normal forms and Herbrand realizations. 305-317 - Sakaé Fuchino:
On the simplicity of the automorphism group ofP(ω)/fin. 319-330 - Jörg Hudelmaier:
Bounds for cut elimination in intuitionistic propositional logic. 331-353 - Martin Otto:
EM constructions for a class of generalized quantifiers. 355-371 - Kai Hauser:
Indescribable cardinals without diamonds. 373-383
Volume 31, Number 6, November 1992
- Michael C. Laskowski, Anand Pillay, Philipp Rothmaler:
Tiny models of categorical theories. 385-396 - Dusko Pavlovic:
On the structure of paradoxes. 397-406 - Giangiacomo Gerla:
Distances, diameters and verisimilitude of theories. 407-414 - Pierangelo Miglioli:
An infinite class of maximal intermediate propositional logics with the disjunction property. 415-432 - Saharon Shelah:
Con(u>i). 433-443 - Heike Mildenberger:
On the homogeneity property for certain quantifier logics. 445-455 - Lee Fong Low, Anand Pillay:
Superstable theories with few countable models. 457-465
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 2025-10-29 01:37 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
