I. Walukiewicz, On completeness of the -calculus, LICS '93, 1993, pp. 136--146. BASIC RESEARCH IN COMPUTER SCIENCE CENTRE OF THE DANISH NATIONAL RESEARCH FOUNDATION (BRICS) Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Note On The Completeness Of Kozen's Axiomatisation Of The.. - Walukiewicz (1996) (3 citations) Self-citation (Walukiewicz Calculus) (Correct)
....1 1 games. It is possible to replace a tableau for a formula with a di#erent arena for the game so that the game becomes # 0 3 . Nevertheless it seems to be impossible to simulate this translation in the proof system (it is possible to do this using a stronger, but still finitary, axiom system [18]) For thin refutations the game is easier. In the general situation traces can split (because of the (and) rule) and merge (because of the implicit contraction) In thin refutations the traces (almost) never merge 360 IGOR WALUKIEWICZ and splitting is in some sense deterministic because ....
I. Walukiewicz, On completeness of the -calculus, LICS '93, 1993, pp. 136--146. BASIC RESEARCH IN COMPUTER SCIENCE CENTRE OF THE DANISH NATIONAL RESEARCH FOUNDATION (BRICS)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC