2010
DOI: 10.1017/s1755020310000213
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial Ring Calculus for Modal Logics: A New Semantics and Proof Method for Modalities

Abstract: A new (sound and complete) proof style adequate for modal logics is defined from the polynomial ring calculus (PRC). The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra–Scholten equational-proof style, and rewriting systems. The method proposed is throughly… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2010
2010
2018
2018

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 16 publications
0
6
0
1
Order By: Relevance
“…The preceding theorem can be strengthened to non-deterministic finite-valued functions as well (and this makes it possible to use polynomial functions with extra-variables to treat non-truth functional logics such as paraconsistent logics and modal logics, (cf. [8] and [1]). Moreover, for fixed p n , there exists a polynomial-time transformation Π that outputs the corresponding polynomial of GF p n [X] for each truth-function, as it can be computed by elementary linear algebra (systems of linear equations) over finite fields.…”
Section: Formal Polynomials As Algebraic Proof Procedures: a Brief Sumentioning
confidence: 98%
See 2 more Smart Citations
“…The preceding theorem can be strengthened to non-deterministic finite-valued functions as well (and this makes it possible to use polynomial functions with extra-variables to treat non-truth functional logics such as paraconsistent logics and modal logics, (cf. [8] and [1]). Moreover, for fixed p n , there exists a polynomial-time transformation Π that outputs the corresponding polynomial of GF p n [X] for each truth-function, as it can be computed by elementary linear algebra (systems of linear equations) over finite fields.…”
Section: Formal Polynomials As Algebraic Proof Procedures: a Brief Sumentioning
confidence: 98%
“…Polynomial ring calculus are particularly appropriate for automatic proof systems not only for finitely many-valued logics, but also for non-truth-functional logics, including modal logics (cf. [1]): even logics that have no finite-valued characteristic semantics, as the paraconsistent logics, can be given a two-valued dyadic semantics expressed by multivariable polynomials over the ring…”
Section: Formal Polynomials As Algebraic Proof Procedures: a Brief Sumentioning
confidence: 99%
See 1 more Smart Citation
“…Using this kind of polynomial rings has been possible to develop a novel semantic procedure to investigate logical modalities [2].…”
Section: Logical Functions 21 the Classical Logical Functions And Thmentioning
confidence: 99%
“…• In certain cases, some constraints on translations will have to be added, as in the cases where modal logic are expressed in polynomial format (see [2]). …”
Section: Introductionmentioning
confidence: 99%