| Title |
Automated proof search system for logic of correlated knowledge / |
| Authors |
Giedra, Haroldas ; Alonderis, Romas |
| DOI |
10.11648/j.ajmcm.20200502.11 |
| Full Text |
|
| Is Part of |
American journal of mathematical and computer modelling.. Science publishing group. 2020, vol. 5, no. 2, p. 29-42.. ISSN 2578-8272. eISSN 2578-8280 |
| Keywords [eng] |
logic of correlated knowledge ; sequent calculus ; automated proof system ; decidability ; soundness ; completeness ; admissibility of the cut rule |
| Abstract [eng] |
Logic of correlated knowledge is one of the latest development in logical systems, allowing to handle information about quantum systems. Quantum system may consist of one or more elementary particles. Associating agent to each particle, we get multi-agent system, where agents can perform observations and get results. Allowing communication between agents, correlations such as quantum entanglement can be extracted. This can not be done by traditional epistemic logic or logic of distributed knowledge. Our main scientific result is proof search system GS-LCK-PROC for logic of correlated knowledge, which lets to reason about knowledge automatically. The core of the system is the sequent calculus GS-LCK with the properties of soundness, completeness, admissibility of cut and structural rules, and invertibility of all rules. The ideas of semantic internalization are used to get such properties for the calculus. The calculus provides convenient means for backward proof search and decision procedure for logic of correlated knowledge. The procedure generates a finite model for each sequent. As a result we get termination of the proof search and decidability of logic of correlated knowledge. |
| Published |
Science publishing group |
| Type |
Journal article |
| Language |
English |
| Publication date |
2020 |
| CC license |
|
