BibTeX records: James C. Owings

download as .bib file

@article{DBLP:journals/aml/OwingsGM02,
  author    = {James C. Owings and
               William I. Gasarch and
               Georgia Martin},
  title     = {Max and min limiters},
  journal   = {Arch. Math. Log.},
  volume    = {41},
  number    = {5},
  pages     = {483--495},
  year      = {2002},
  url       = {https://doi.org/10.1007/s001530100121},
  doi       = {10.1007/s001530100121},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/aml/OwingsGM02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelGGO93,
  author    = {Richard Beigel and
               William I. Gasarch and
               John Gill and
               James C. Owings},
  title     = {Terse, Superterse, and Verbose Sets},
  journal   = {Inf. Comput.},
  volume    = {103},
  number    = {1},
  pages     = {68--85},
  year      = {1993},
  url       = {https://doi.org/10.1006/inco.1993.1014},
  doi       = {10.1006/inco.1993.1014},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/BeigelGGO93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/HarizanovKO92,
  author    = {Valentina S. Harizanov and
               Martin Kummer and
               James C. Owings},
  title     = {Frequency Computations and the Cardinality Theorem},
  journal   = {J. Symb. Log.},
  volume    = {57},
  number    = {2},
  pages     = {682--687},
  year      = {1992},
  url       = {https://doi.org/10.2307/2275300},
  doi       = {10.2307/2275300},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/HarizanovKO92.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/JockuschO90,
  author    = {Carl G. Jockusch Jr. and
               James C. Owings},
  title     = {Weakly Semirecursive Sets},
  journal   = {J. Symb. Log.},
  volume    = {55},
  number    = {2},
  pages     = {637--644},
  year      = {1990},
  url       = {https://doi.org/10.2307/2274653},
  doi       = {10.2307/2274653},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/JockuschO90.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeigelGO89,
  author    = {Richard Beigel and
               William I. Gasarch and
               James C. Owings},
  title     = {Nondeterministic Bounded Query Reducibilities},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {41},
  number    = {2},
  pages     = {107--118},
  year      = {1989},
  url       = {https://doi.org/10.1016/0168-0072(89)90010-9},
  doi       = {10.1016/0168-0072(89)90010-9},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/BeigelGO89.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Owings89,
  author    = {James C. Owings},
  title     = {A Cardinality Version of Biegel's Nonspeedup Theorem},
  journal   = {J. Symb. Log.},
  volume    = {54},
  number    = {3},
  pages     = {761--767},
  year      = {1989},
  url       = {https://doi.org/10.2307/2274739},
  doi       = {10.2307/2274739},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/Owings89.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Owings89,
  author    = {James C. Owings},
  title     = {Corrigendum to "Diagonalization and the Recursion Theorem"},
  journal   = {Notre Dame J. Formal Log.},
  volume    = {30},
  number    = {1},
  pages     = {153},
  year      = {1989},
  url       = {http://projecteuclid.org/euclid.ndjfl/1093635004},
  timestamp = {Thu, 21 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ndjfl/Owings89.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Owings86,
  author    = {James C. Owings},
  title     = {Effective Choice Functions and Index Sets},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {32},
  number    = {3},
  pages     = {370--373},
  year      = {1986},
  url       = {https://doi.org/10.1016/0022-0000(86)90035-8},
  doi       = {10.1016/0022-0000(86)90035-8},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/Owings86.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/OwingsPS76,
  author    = {James C. Owings and
               Hilary Putnam and
               Gerald E. Sacks},
  title     = {Meeting of the Association for Symbolic Logic Washington, D.C., 1975},
  journal   = {J. Symb. Log.},
  volume    = {41},
  number    = {1},
  pages     = {279--288},
  year      = {1976},
  url       = {https://doi.org/10.1017/S0022481200051987},
  doi       = {10.1017/S0022481200051987},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/OwingsPS76.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Owings75,
  author    = {James C. Owings},
  title     = {Splitting a Context-Sensitive Set},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {10},
  number    = {1},
  pages     = {83--87},
  year      = {1975},
  url       = {https://doi.org/10.1016/S0022-0000(75)80016-X},
  doi       = {10.1016/S0022-0000(75)80016-X},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/Owings75.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Owings73,
  author    = {James C. Owings},
  title     = {Diagonalization and the recursion theorem},
  journal   = {Notre Dame J. Formal Log.},
  volume    = {14},
  number    = {1},
  pages     = {95--99},
  year      = {1973},
  url       = {https://doi.org/10.1305/ndjfl/1093890812},
  doi       = {10.1305/ndjfl/1093890812},
  timestamp = {Thu, 21 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ndjfl/Owings73.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics