Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Polynomial semantics for modal logics

Polynomial semantics for modal logics It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

Polynomial semantics for modal logics

Polynomial semantics for modal logics

Abstract

It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics.
Loading next page...
 
/lp/taylor-francis/polynomial-semantics-for-modal-logics-lU7IqmWUpG
Publisher
Taylor & Francis
Copyright
© 2019 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.2019.1676004
Publisher site
See Article on Publisher Site

Abstract

It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics.

Journal

Journal of Applied Non-Classical LogicsTaylor & Francis

Published: Oct 2, 2019

Keywords: Polynomial semantics; modal logic; modal polynomials; Gröbner basis

References