Entry Gardiner:1995:APC 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{Gardiner:1995:APC,
  author =       "P. H. B. Gardiner",
  title =        "Algebraic proofs of consistency and completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "161--191",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=150&issue=1&aid=1845",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Formal Syst. Eur. Ltd., Oxford, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic proofs; arbitrary predicate transformer;
                 calculus of refinement; completeness; consistency;
                 direct translation; floor-like operator; formal logic;
                 Galois connection; Hoare logic inference rules;
                 inference mechanisms; natural ordering; nearest
                 embedded relation; predicate transformers; program
                 refinement; program verification; relational calculus;
                 set theory; soundness; weak algebraic set theory;
                 weakest prespecification operator",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries