Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 29
Volume 29, Number 1, March 1989
- Anand Pillay:
On fields definable inQp. 1-7 - Peter Clote:
The metamathematics of scattered linear orderings. 9-20 - Anastasis Kamburelis:
Iterations of Boolean algebras with measure. 21-28 - Lev Gordeev:
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. 29-46 - Kostas Hatzikiriakou:
Algebraic disguises ofΣ10 induction. 47-51 - Giovanna Corsi, Silvio Ghilardi
:
Directed frames. 53-67
Volume 29, Number 2, June 1989
- Richard Beigel, William I. Gasarch, Louise Hay:
Bounded query classes and the difference hierarchy. 69-84 - V. Michele Abrusci:
Some uses of dilators in combinatorial problems - Part III. Independence results by means of decreasingF-sequences (F Weakly Finite Dilator). 85-109 - Wolfgang Rautenberg:
Axiomatization of semigroup consequences. 111-123 - Silvio Ghilardi:
Presheaf semantics and independence results for some non-classical first-order logics. 125-136
Volume 29, Number 3, September 1990
- Christopher C. Leary:
Superstationary and ineffablen cardinals. 137-148 - Gaisi Takeuti:
S3i andV2i(BD). 149-169 - Wim Veldman, Michael Janssen:
Some observations on intuitionistically elementary properties of linear orderings. 171-185 - Ivan N. Soskov:
Computability by means of effectively definable schemes and definability via enumerations. 187-200 - Richard A. Shore, Theodore A. Slaman:
Working below a low2 recursively enumerably degree. 201-211
Volume 29, Number 4, December 1990
- Alistair H. Lachlan:
Some coinductive graphs. 213-229 - J. C. E. Dekker:
An isolic generalization of Cauchy's theorem for finite groups. 231-236 - Volker Weispfenning:
Existential equivalence of ordered abelian groups with parameters. 237-248 - Michael Rathjen:
Ordinal notations based on a weakly Mahlo cardinal. 249-263 - Erich Grädel:
Satisfiability of formulae with one ∀ is decidable in exponential time. 265-276
a service of 
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 2024-07-11 20:54 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
