Search dblp for Publications

export results for "toc:db/journals/aml/aml36.bht:"

 download as .bib file

@article{DBLP:journals/aml/Abe97,
  author       = {Yoshihiro Abe},
  title        = {A hierarchy of filters smaller than \emph{CF}\({}_{\mbox{kappa}}\)lambda},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {385--397},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050071},
  doi          = {10.1007/S001530050071},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Abe97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Bailey97,
  author       = {Colin G. Bailey},
  title        = {Relativized projecta and b{\textbackslash}beta-r.e. sets},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {289--296},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050066},
  doi          = {10.1007/S001530050066},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Bailey97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/BaratellaB97,
  author       = {Stefano Baratella and
                  Stefano Berardi},
  title        = {A parallel game semantics for Linear Logic},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {3},
  pages        = {189--217},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050061},
  doi          = {10.1007/S001530050061},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/BaratellaB97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Burke97,
  author       = {Maxim R. Burke},
  title        = {A proof of Hechler's theorem on embedding Aleph\({}_{\mbox{1}}\)-directed
                  sets cofinally into (w\({}^{\mbox{w}}\), {\textless}\({}^{\mbox{*}}\))},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {399--403},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050072},
  doi          = {10.1007/S001530050072},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Burke97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/CaiCDF97,
  author       = {Liming Cai and
                  Jianer Chen and
                  Rodney G. Downey and
                  Michael R. Fellows},
  title        = {On the parameterized complexity of short computation and factorization},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {321--337},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050069},
  doi          = {10.1007/S001530050069},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/CaiCDF97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/JudahS97,
  author       = {Haim Judah and
                  Otmar Spinas},
  title        = {Large cardinals and projective sets},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {2},
  pages        = {137--155},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050059},
  doi          = {10.1007/S001530050059},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/JudahS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Kikuchi97,
  author       = {Makoto Kikuchi},
  title        = {Kolmogorov complexity and the second incompleteness theorem},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {437--443},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050074},
  doi          = {10.1007/S001530050074},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Kikuchi97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/KristiansenN97,
  author       = {Lill Kristiansen and
                  Dag Normann},
  title        = {Total objects in inductively defined types},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {405--436},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050073},
  doi          = {10.1007/S001530050073},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/KristiansenN97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/LemppL97,
  author       = {Steffen Lempp and
                  Manuel Lerman},
  title        = {Iterated trees of strategies and priority arguments},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {297--312},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050067},
  doi          = {10.1007/S001530050067},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/LemppL97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/MarekNR97,
  author       = {V. Wiktor Marek and
                  Anil Nerode and
                  Jeffrey B. Remmel},
  title        = {Nonmonotonic rule systems with recursive sets of restraints},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {339--384},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050070},
  doi          = {10.1007/S001530050070},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/MarekNR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Normann97,
  author       = {Dag Normann},
  title        = {Hereditarily effective typestreams},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {3},
  pages        = {219--225},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050062},
  doi          = {10.1007/S001530050062},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Normann97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Normann97a,
  author       = {Dag Normann},
  title        = {Closing the gap between the continuous functionals and recursion in
                  \({}^{\mbox{3}}\)\emph{E}},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {269--287},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050065},
  doi          = {10.1007/S001530050065},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Normann97a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Nour97,
  author       = {Karim Nour},
  title        = {La valeur d'un entier classique en lm{\textbackslash}lambda{\textbackslash}mu-calcul},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {461--473},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050076},
  doi          = {10.1007/S001530050076},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Nour97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Owings97,
  author       = {Jim Owings},
  title        = {Rank, join, and Cantor singletons},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {313--320},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050068},
  doi          = {10.1007/S001530050068},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Owings97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Riis97,
  author       = {S{\o}ren Riis},
  title        = {Count( \emph{q}q) versus the pigeon-hole principle},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {3},
  pages        = {157--188},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050060},
  doi          = {10.1007/S001530050060},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/aml/Riis97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Schmid97,
  author       = {Joachim Schmid},
  title        = {Existentially closed fields with holomorphy rings},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {2},
  pages        = {127--135},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050058},
  doi          = {10.1007/S001530050058},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Schmid97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Shelah97,
  author       = {Saharon Shelah},
  title        = {Set theory without choice: not everything on cofinality is possible},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {2},
  pages        = {81--125},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050057},
  doi          = {10.1007/S001530050057},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Shelah97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Shore97,
  author       = {Richard A. Shore},
  title        = {Conjectures and questions from Gerald Sacks's \emph{Degrees of Unsolvability}},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {233--253},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050063},
  doi          = {10.1007/S001530050063},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Shore97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/SlamanW97,
  author       = {Theodore A. Slaman and
                  W. Hugh Woodin},
  title        = {Definability in the enumeration degrees},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {4-5},
  pages        = {255--267},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050064},
  doi          = {10.1007/S001530050064},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/SlamanW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Weiermann97,
  author       = {Andreas Weiermann},
  title        = {A proof of strongly uniform termination for G{\"{o}}del's \emph{T}T
                  by methods from local predicativity},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {6},
  pages        = {445--460},
  year         = {1997},
  url          = {https://doi.org/10.1007/s001530050075},
  doi          = {10.1007/S001530050075},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Weiermann97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/BeckmannW96,
  author       = {Arnold Beckmann and
                  Andreas Weiermann},
  title        = {A term rewriting characterization of the polytime functions and related
                  complexity classes},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {1},
  pages        = {11--30},
  year         = {1996},
  url          = {https://doi.org/10.1007/s001530050054},
  doi          = {10.1007/S001530050054},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/BeckmannW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/DingQ96,
  author       = {Decheng Ding and
                  Lei Qian},
  title        = {Isolated d.r.e. degrees are dense in r.e. degree structure},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {1},
  pages        = {1--10},
  year         = {1996},
  url          = {https://doi.org/10.1007/s001530050053},
  doi          = {10.1007/S001530050053},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/DingQ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/Kohlenbach96,
  author       = {Ulrich Kohlenbach},
  title        = {Mathematically strong subsystems of analysis with low rate of growth
                  of provably recursive functionals},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {1},
  pages        = {31--71},
  year         = {1996},
  url          = {https://doi.org/10.1007/s001530050055},
  doi          = {10.1007/S001530050055},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/Kohlenbach96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aml/KossakB96,
  author       = {Roman Kossak and
                  Nicholas Bamber},
  title        = {On two questions concerning the automorphism groups of countable recursively
                  saturated models of {PA}},
  journal      = {Arch. Math. Log.},
  volume       = {36},
  number       = {1},
  pages        = {73--79},
  year         = {1996},
  url          = {https://doi.org/10.1007/s001530050056},
  doi          = {10.1007/S001530050056},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aml/KossakB96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.