Entry Lincoln:1994:FOL from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Lincoln:1994:FOL,
  author =       "P. Lincoln and A. Scedrov",
  title =        "First-order linear logic without modalities is
                 {NEXPTIME}-hard",
  journal =      j-THEOR-COMP-SCI,
  volume =       "135",
  number =       "1",
  pages =        "139--153",
  day =          "05",
  month =        dec,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:36 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=135&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=135&issue=1&aid=1748",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C6110L (Logic programming)C4220 (Automata
                 theory)",
  conflocation = "Oxford, UK; April 1992",
  conftitle =    "Mathematical Foundations of Programming Semantics",
  corpsource =   "Comput. Sci. Lab., SRI Int., Menlo Park, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; decision problem;
                 first-order linear logic; formal logic; hardness proof;
                 logic programming; modalities; multiplicative-additive
                 fragment; NEXPTIME-hard; nondeterministic Turing
                 machines; PSPACE-hardness; quantified boolean formula;
                 Shapiro's logic programming simulation; Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries