Blending margins

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

We investigate properties of the formula p -> []p in the basic modal logic K.
We show that K satisfies an infinitary weak variant of the rule of margins,
which leads to a description of a complete set of unifiers of p -> []p. Using
this information, we establish that K has nullary unification type. Moreover,
we show that the formula p -> []p is admissibly saturated, but not exact.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-625798

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.