A real-valued modal logic

Diaconescu, Denisa; Metcalfe, George; Schnüriger, Laura Janina (2018). A real-valued modal logic. Logical methods in computer science, 14(1), pp. 1-27. Department of Theoretical Computer Science, Technical University of Braunschweig 10.23638/LMCS-14(1:10)2018

[img]
Preview
Text
1706.02854.pdf - Published Version
Available under License Creative Commons: Attribution (CC-BY).

Download (337kB) | Preview

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is provided and a coNEXPTIME upper bound obtained for checking validity in the logic. Focussing on the modal-multiplicative fragment, the labelled tableau system is then used to establish completeness for a sequent calculus that admits cut-elimination and an axiom system that extends the multiplicative fragment of Abelian logic.

Item Type:

Journal Article (Original Article)

Division/Institute:

08 Faculty of Science > Department of Mathematics and Statistics > Institute of Mathematics

UniBE Contributor:

Diaconescu, Denisa; Metcalfe, George and Schnüriger, Laura Janina

Subjects:

500 Science > 510 Mathematics

ISSN:

1860-5974

Publisher:

Department of Theoretical Computer Science, Technical University of Braunschweig

Language:

English

Submitter:

George Metcalfe

Date Deposited:

11 Apr 2018 12:48

Last Modified:

29 Oct 2019 07:33

Publisher DOI:

10.23638/LMCS-14(1:10)2018

BORIS DOI:

10.7892/boris.110349

URI:

https://boris.unibe.ch/id/eprint/110349

Actions (login required)

Edit item Edit item
Provide Feedback