Entry Volger:1983:TML from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Volger:1983:TML,
  author =       "H. Volger",
  title =        "{Turing} machines with linear alternation, theories of
                 bounded concatenation and the decision problem of first
                 order theories",
  journal =      j-THEOR-COMP-SCI,
  volume =       "23",
  number =       "3",
  pages =        "333--337",
  month =        may,
  year =         "1983",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Maths. Inst., Univ. T{\"u}bingen, T{\"u}bingen, West
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary tree; computability and decidability;
                 computational complexity; decision problem; elementary
                 recursive sets; first order theories; intermediate
                 hierarchy; linear alternation; recursive functions; set
                 theory; time classes; trees (mathematics); Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries