Stéphane Demri, Rajeev Goré  Home/Search
Context
Related
| anu.edu.au/pub/pap...ftp99final.ps.gz anu.edu.au/pub/pap...ftp99final.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: anu.edu.au/~rpg/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The provability logic Grz is characterized by a class of modal frames that is not first-order definable. We present a simple embedding of Grz into decidable fragments of classical first-order logic such as FO 2 and the guarded fragment. The embedding is an O((n:log n) 3 )-time transformation that neither involves first principles about Turing machines (and therefore is easy to implement), nor the semantical characterization of Grz (and therefore does not use any second-order machinery).... (Update)
Similar documents (at the sentence level):
30.4%: An O((n log n)³)-time transformation from Grz .. - Stéphane.. (1998) (Correct)
27.3%: An O((n.log n)³)-time transformation from Grz into.. - Demri, Goré (1998) (Correct)
Active bibliography (related documents): More All
1.7: Tractable Transformations from Modal Provability Logics.. - Demri, Goré (1999) (Correct)
0.8: Theoremhood Preserving Maps As A Characterisation Of Cut.. - Demri, Goré (1999) (Correct)
0.6: Theoremhood Preserving Maps Characterising Cut Elimination.. - Demri, Goré (2001) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Optimised Functional Translation and Resolution - Hustadt, Schmidt, Weidenbach (1998) (Correct)
0.3: Theory for Long Time Polymer and Protein Dynamics: Basis.. - Tang, Chang, Freed (Correct)
0.3: Logic of Proofs with the strong provability operator - Elena Nogina (1994) (Correct)
BibTeX entry: (Update)
@misc{ demri-onlog,
author = "Stéphane Demri and Rajeev Goré",
title = "An O((n.log n)³)-time transformation from Grz into decidable fragments
of classical first-order logic",
url = "citeseer.ist.psu.edu/article/demri98onlog.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
242 Proof methods for modal and intuitionistic logics (context) - Fitting - 1983
130 The computational complexity of provability in systems of mo.. (context) - Ladner - 1977
65 Modal logic and classical logic (context) - van Benthem - 1983
62 First-order modal tableaux (context) - Fitting - 1988
59 A resolution calculus for modal logics - Ohlbach - 1988
53 Journal of Philosophical Logic (context) - Belnap - 1982
40 Modal languages and bounded fragments of predicate logic (context) - Andreka, Nemeti et al. - 1998
38 Cambridge University Press (context) - Boolos, of - 1993
35 Complexity results for classes of quantificational formulas (context) - Lewis - 1980
30 Provability interpretations of modal logics (context) - Solovay - 1976
25 Modal tableau calculi and interpolation (context) - Rautenberg - 1983
24 Raisonnement automatique en logique modale et algorithmes d'.. (context) - Herzig - 1989
19 Clarendon Press (context) - Chagrov, Zakharyaschev - 1997
18 Gentzen method in modal calculi (context) - Ohnishi, Matsumoto - 1957
17 A resolution-based decision procedure for extensions of K - Ganzinger, Hustadt et al. - 1998
16 Tableaux methods for modal and temporal logics (context) - Gor'e - 1999
16 Improved decision procedures for the modal logics K (context) - Hudelmaier - 1996
13 Combining Hilbert style and semantic reasoning in a resoluti.. - Ohlbach - 1998
12 On modal systems having arithmetical interpretations (context) - Avron - 1984
12 Cut-free sequent and tableau systems for propositional Diodo.. (context) - Gor'e - 1994
11 Modal theorem proving (context) - Abadi, Manna - 1986
11 A resolution decision procedure for the guarded fragment (context) - de Nivelle - 1998
10 Methods for automated theorem proving in non classical logic.. (context) - Morgan - 1976
9 Gentzen-type and resolution rules part I: propositional logi.. (context) - Mints - 1988
7 The computational complexity of the unconstrained limited do.. (context) - Furer - 1981
7 Optimized translation of multi modal logic into predicate lo.. (context) - Ohlbach - 1993
7 A translation from the modal logic of provability into K (context) - Balbiani, Herzig - 1994
6 Relations between propositional normal modal logics: an over.. - Gor'e, Heinle et al. - 1997
6 time transformation from Grz into decidable fragments of cla.. - Demri, Gor'e et al. - 1998
5 and contraction-free tableaux for S (context) - Cerrito, Mayer et al. - 1997
4 Resolution-based calculi for modal and temporal logics (context) - Nonnengart - 1996
3 Theoremhood preserving maps as a characterisation of cut eli.. - Demri, Gor'e - 1999
3 Zeitschrift fur Mathematik Logik und Grundlagen der Mathemat.. (context) - Mortimer, with - 1975
2 A set-theoretical translation method for polymodal logics (context) - d'Agostino, Montanari et al. - 1995
1 Fakultat der Universitat des Saarlandes (context) - Schmidt, Translation et al. - 1997
1 The Range of Modal Logic - An Essay in Memory of George Garg.. (context) - van Benthem - 1999
Documents on the same site (http://arp.anu.edu.au/~rpg/publications.html): More
Substructural Logics on Display - Goré (1998) (Correct)
A Labelled Sequent System for Tense Logic K t - Bonnette, Goré (1998) (Correct)
Relations Between Propositional Normal Modal Logics: An Overview - Goré, al. (1995) (Correct)
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