Entry Urquhart:1989:CGS from tcs1985.bib

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

Index sections

Top | Symbols | Numbers | 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{Urquhart:1989:CGS,
  author =       "A. Urquhart",
  title =        "The complexity of {Gentzen} systems for propositional
                 logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "66",
  number =       "1",
  pages =        "87--97",
  day =          "2",
  month =        aug,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Philos., Toronto Univ., Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "biconditional; complexity; computational complexity;
                 exponentially long proofs; formal logic; Gentzen
                 systems; polynomial size proofs; propositional logic;
                 valid sequents",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries