Abstract
We axiomatize the valid formulas of several logics of feature structures. The logics are similar to those studied by Johnson [2], Kasper and Rounds [3], Moshier and Rounds [4], and Rounds [7], and they include path equalities and set values. Our completeness proofs do not use reduction to normal forms or tableaux, in contrast to the papers cited. Instead they use structures built from maximal consistent sets, as in standard completeness arguments for modal logics. We also consider the forcing semantics of implication introduced to work on feature structure logics by Moshier and Rounds [4]. Our results here are based on, and strengthen, the connection between Kripke models and intuitionistic logic.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
