M. Mortimer. On language with two variables. Zeitschrift fur Mathematik Logik und Grundlagen der Mathematik, 21:135--140, 1975. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An O((n.log n)³)-time transformation from Grz into.. - Demri, Goré (1998) (Correct)
....is a slight variant of the one presented in [4] see also [7] The reduction announced in the title can be obtained by Also called GL (for Godel and Lob) KW, K4W, PrL. Also called transformation , see e.g. 23] 128 translating T into FO 2 , which is known to be decidable (see e.g. [18]) Furthermore, the formula obtained by reduction belongs to the decidable guarded fragment of classical logic for which a resolution decision procedure has been defined in [19] In [3, Chapter 12] a (non polynomial time) transformation from Grz into G is defined. By using renamings of ....
M. Mortimer. On language with two variables. Zeitschrift fur Mathematik Logik und Grundlagen der Mathematik, 21:135--140, 1975.
An O((n.log n)³)-time transformation from Grz into.. - Demri, Goré (1998) (Correct)
....via an analysis of the proofs in cut free sequent calculi from the literature. The second reduction is a slight variant of the one presented in [CCM97] see also [Fit88] The reduction announced in the title can be obtained by translating T into FO 2 , which is known to be decidable (see e.g. [Mor75]) Furthermore, the formula obtained by reduction belongs to the decidable guarded fragment of classical logic (see e.g. ANB98] for which a resolution decision procedure has been defined in [Niv98] In [Boo93, Chapter 12] a (non polynomial time) transformation from Grz into G is defined. By ....
M. Mortimer. On language with two variables. Zeitschrift fur Mathematik Logik und Grundlagen der Mathematik, 21:135--140, 1975.
An O((n log n)³)-time transformation from Grz .. - Stéphane.. (1998) (Correct)
....is a slight variant of the one presented in [4] see also [7] The reduction announced in the title can be obtained by 1 Also called GL (for Godel and Lob) KW, K4W, PrL. 2 Also called transformation , see e.g. 23] translating T into FO 2 , which is known to be decidable (see e.g. [18]) Furthermore, the formula obtained by reduction belongs to the decidable guarded fragment of classical logic for which a resolution decision procedure has been defined in [19] In [3, Chapter 12] a (non polynomial time) transformation from Grz into G is defined. By using renamings of ....
M. Mortimer. On language with two variables. Zeitschrift fur Mathematik Logik und Grundlagen der Mathematik, 21:135--140, 1975.
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