A Simplest Undecidable Modal Logic

Details A Simplest Undecidable Modal Logic A Simplest Undecidable Modal Logic

2011-05-04

arxiv.org/abs/1105.0845v1

Computer Science

Logic in Computer Science

18 pages

Scientific paper

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is an undecidable modal logic that can be obtained by restricting the allowed models with a first-order formula in which only universal quantifiers appear.

Affiliated with

Also associated with

No associations

Rating

A Simplest Undecidable Modal 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 A Simplest Undecidable Modal Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simplest Undecidable Modal Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689568