default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 36
Volume 36, Number 1, December 1996
- Decheng Ding, Lei Qian:
Isolated d.r.e. degrees are dense in r.e. degree structure. 1-10 - Arnold Beckmann
, Andreas Weiermann:
A term rewriting characterization of the polytime functions and related complexity classes. 11-30 - Ulrich Kohlenbach:
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. 31-71 - Roman Kossak, Nicholas Bamber:
On two questions concerning the automorphism groups of countable recursively saturated models of PA. 73-79
Volume 36, Number 2, February 1997
- Saharon Shelah:
Set theory without choice: not everything on cofinality is possible. 81-125 - Joachim Schmid:
Existentially closed fields with holomorphy rings. 127-135 - Haim Judah, Otmar Spinas:
Large cardinals and projective sets. 137-155
Volume 36, Number 3, April 1997
- Søren Riis:
Count( qq) versus the pigeon-hole principle. 157-188 - Stefano Baratella, Stefano Berardi:
A parallel game semantics for Linear Logic. 189-217 - Dag Normann:
Hereditarily effective typestreams. 219-225
Volume 36, Numbers 4-5, August 1997
- Richard A. Shore:
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. 233-253 - Theodore A. Slaman, W. Hugh Woodin:
Definability in the enumeration degrees. 255-267 - Dag Normann:
Closing the gap between the continuous functionals and recursion in 3E. 269-287 - Colin G. Bailey:
Relativized projecta and b\beta-r.e. sets. 289-296 - Steffen Lempp, Manuel Lerman:
Iterated trees of strategies and priority arguments. 297-312 - Jim Owings:
Rank, join, and Cantor singletons. 313-320 - Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the parameterized complexity of short computation and factorization. 321-337 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Nonmonotonic rule systems with recursive sets of restraints. 339-384
Volume 36, Number 6, October 1997
- Yoshihiro Abe:
A hierarchy of filters smaller than CFkappalambda. 385-397 - Maxim R. Burke:
A proof of Hechler's theorem on embedding Aleph1-directed sets cofinally into (ww, <*). 399-403 - Lill Kristiansen, Dag Normann:
Total objects in inductively defined types. 405-436 - Makoto Kikuchi:
Kolmogorov complexity and the second incompleteness theorem. 437-443 - Andreas Weiermann:
A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. 445-460 - Karim Nour:
La valeur d'un entier classique en lm\lambda\mu-calcul. 461-473
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-12-08 09:50 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:
