Deciding regular grammar logics with converse through first-order logic

Details Deciding regular grammar logics with converse through first-order logic Deciding regular grammar logics with converse through first-order logic

2003-06-20

arxiv.org/abs/cs/0306117v2

Computer Science

Logic in Computer Science

34 pages

Scientific paper

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. This translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. A consequence of the translation is that the general satisfiability problem for regular grammar logics with converse is in EXPTIME. This extends a previous result of the first author for grammar logics without converse. Using the same method, we show how some other modal logics can be naturally translated into GF2, including nominal tense logics and intuitionistic logic. In our view, the results in this paper show that the natural first-order fragment corresponding to regular grammar logics is simply GF2 without extra machinery such as fixed point-operators.

Affiliated with

Also associated with

No associations

Rating

Deciding regular grammar logics with converse through first-order logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding regular grammar logics with converse through first-order logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding regular grammar logics with converse through first-order logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243546