Abstract
Hintikka’s semantic game for classical logic is generalized to the family of all finite valued matrices. This in turn serves as a springboard for developing game semantics for all propositional formulas with respect to arbitrary finite non-deterministic matrices. In this approach a new concept of non-deterministic valuation, called ‘liberal valuation’, emerges that augments the usually employed static and dynamic valuations in a natural manner. Liberal valuation is shown to correspond to unrestricted semantic games, while the characterization of static and dynamic valuations involves certain restrictions of the game that are handled by an interactive pruning procedure.
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.
