Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Mey:1994:FGP, author = "Daniel Mey", title = "Finite games for a predicate logic without contractions", journal = j-THEOR-COMP-SCI, volume = "123", number = "2", pages = "341--349", day = "31", month = jan, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:51 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=123&issue=2; 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=123&issue=2&aid=1498", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., ETH Zurich, Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "classical logic; finite games; formal logic; game theory; multiset calculus; predicate calculus; predicate logic; provability; winning strategies", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }