Characterization and definability in modal first-order fragments

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof for most modal logics below first order is still too ambitious. In this thesis we plan to isolate sufficient conditions for the characterization and definability theorems to hold in a wide range of logics. Along with these conditions we will prove that, whichever logic that meets them, satisfies both theorems. Therefore, one could give an unifying proof for logics with already known results. Moreover, one will be able to prove characterization and definability results for logics that have not yet been investigated. In both cases, it is only needed to check that a logic meets the requirements to automatically derive the desired results.

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

Characterization and definability in modal first-order fragments 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 Characterization and definability in modal first-order fragments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization and definability in modal first-order fragments will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-656668

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