Abstract

ABSTRACTIt 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.

Full Text
Published version (Free)

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 call