@phdthesis{Baier1998,
  author    = {Baier, Herbert},
  title     = {Operators of Higher Order},
  publisher = {Shaker Verlag},
  isbn      = {3-8265-4008-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-140799},
  school      = {Universit{\"a}t W{\"u}rzburg},
  pages     = {V, 95},
  year      = {1998},
  abstract  = {Motivated by results on interactive proof systems we investigate the computational power of quantifiers applied to well-known complexity classes. In special, we are interested in existential, universal and probabilistic bounded error quantifiers ranging over words and sets of words, i.e. oracles if we think in a Turing machine model. In addition to the standard oracle access mechanism, we also consider quantifiers ranging over oracles to which access is restricted in a certain way.},
  subject      = {Komplexit{\"a}tstheorie},
  language  = {en}
}