Entry Kaivola:1998:AEC 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{Kaivola:1998:AEC,
  author =       "Roope Kaivola",
  title =        "Axiomatising extended computation tree logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "190",
  number =       "1",
  pages =        "41--60",
  day =          "10",
  month =        jan,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:21:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=190&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/190/1/2619.pdf",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  conflocation = "Linkoping, Sweden; 22-24 April 1996",
  conftitle =    "CAAP: 21st Colloquium on Trees in Algebra and
                 Programming",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aconjunctive deterministic normal form; automata
                 theory; axiomatisation; completeness proof; computation
                 tree logic; formal logic; inference mechanisms; linear
                 time mu-calculus; path formulae; process algebra;
                 temporal logic",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries