Search dblp for Publications

export results for "toc:db/journals/apal/apal94.bht:"

 download as .bib file

@article{DBLP:journals/apal/BeckmannP98,
  author       = {Arnold Beckmann and
                  Wolfram Pohlers},
  title        = {Applications of Cut-Free Infinitary Derivations to Generalized Recursion
                  Theory},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {7--19},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00063-8},
  doi          = {10.1016/S0168-0072(97)00063-8},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/BeckmannP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/CenzerR98,
  author       = {Douglas A. Cenzer and
                  Jeffrey B. Remmel},
  title        = {Feasible Graphs with Standard Universe},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {21--35},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00064-X},
  doi          = {10.1016/S0168-0072(97)00064-X},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/CenzerR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Cholak98,
  author       = {Peter Cholak},
  title        = {The Dense Simple Sets are Orbit Complete with Respect to the Simple
                  Sets},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {37--44},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00065-1},
  doi          = {10.1016/S0168-0072(97)00065-1},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Cholak98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/DowneyS98,
  author       = {Rodney G. Downey and
                  Richard A. Shore},
  title        = {Splitting Theorems and the Jump Operator},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {45--52},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00066-3},
  doi          = {10.1016/S0168-0072(97)00066-3},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/DowneyS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Fejer98,
  author       = {Peter A. Fejer},
  title        = {Lattice Representations for Computability Theory},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {53--74},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00067-5},
  doi          = {10.1016/S0168-0072(97)00067-5},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Fejer98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Goncharov98,
  author       = {Sergei S. Goncharov},
  title        = {Decidable Boolean Algebras of Low Level},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {75--95},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00068-7},
  doi          = {10.1016/S0168-0072(97)00068-7},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Goncharov98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/HarringtonS98,
  author       = {Leo Harrington and
                  Robert I. Soare},
  title        = {Definable Properties of the Computably Enumerable Sets},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {97--125},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00069-9},
  doi          = {10.1016/S0168-0072(97)00069-9},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/HarringtonS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Knight98,
  author       = {Julia F. Knight},
  title        = {Coding a Family of Sets},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {127--142},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00070-5},
  doi          = {10.1016/S0168-0072(97)00070-5},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Knight98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Lerman98,
  author       = {Manuel Lerman},
  title        = {A Necessary and Sufficient Condition for Embedding Ranked Finite Partial
                  Lattices into the Computably Enumerable Degrees},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {143--180},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00071-7},
  doi          = {10.1016/S0168-0072(97)00071-7},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Lerman98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/RathjenGP98,
  author       = {Michael Rathjen and
                  Edward R. Griffor and
                  Erik Palmgren},
  title        = {Inaccessibility in Constructive Set Theory and Type Theory},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {181--200},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00072-9},
  doi          = {10.1016/S0168-0072(97)00072-9},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/RathjenGP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Schwichtenberg98,
  author       = {Helmut Schwichtenberg},
  title        = {Finite Notations for Infinite Terms},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {201--222},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00073-0},
  doi          = {10.1016/S0168-0072(97)00073-0},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Schwichtenberg98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Shlapentokh98,
  author       = {Alexandra Shlapentokh},
  title        = {Weak Presentations of Non-Finitely Generated Fields},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {223--252},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00074-2},
  doi          = {10.1016/S0168-0072(97)00074-2},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Shlapentokh98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/SlamanW98,
  author       = {Theodore A. Slaman and
                  W. Hugh Woodin},
  title        = {Extending Partial Orders to Dense Linear Orders},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {253--261},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00075-4},
  doi          = {10.1016/S0168-0072(97)00075-4},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/SlamanW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Sorbi98,
  author       = {Andrea Sorbi},
  title        = {Sets of Generators and Automorphism Bases for the Enumeration Degrees},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {263--272},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00076-6},
  doi          = {10.1016/S0168-0072(97)00076-6},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Sorbi98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/Stephan98,
  author       = {Frank Stephan},
  title        = {Learning via Queries and Oracles},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {94},
  number       = {1-3},
  pages        = {273--296},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(97)00077-8},
  doi          = {10.1016/S0168-0072(97)00077-8},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/Stephan98.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.