Entry Nagaymam:1998:GTC from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Nagaymam:1998:GTC,
  author =       "M. Nagaymam and M. Okada",
  title =        "A graph-theoretic characterization theorem for
                 multiplicative fragment of noncommutative linear
                 logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "197",
  number =       "1--2",
  pages =        "246--??",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed May 27 07:21:35 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory)",
  conflocation = "Tokyo, Japan; 28 March-2 April 1996",
  conftitle =    "Linear Logic '96 (papers in summary form only
                 received)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "commutative linear logic; cyclic linear logic; formal
                 logic; graph theory; graph-theoretic characterization
                 theorem; module cyclic shifts; multiplicative fragment;
                 noncommutative linear logic; plane Danos-Regnier graph;
                 proof net; stack-condition; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "G General Review",
  xxnote =       "Check page numbers: duplicate in adjacent entries",
}

Related entries