Gheorghiu, A;
Marin, S;
(2021)
Focused Proof-search in the Logic of Bunched Implications.
In:
Foundations of Software Science and Computation Structures.
Springer: Cham, Switzerland.
Preview |
Text
Gheorghiu_2021_Book_FoundationsOfSoftwareScienceAn.pdf - Published Version Download (7MB) | Preview |
Abstract
The logic of Bunched Implications (BI) freely combines additive and multiplicative connectives, including implications; however, despite its well-studied proof theory, proof-search in BI has always been a difficult problem. The focusing principle is a restriction of the proof-search space that can capture various goal-directed proof-search procedures. In this paper we show that focused proof-search is complete for BI by first reformulating the traditional bunched sequent calculus using the simpler data-structure of nested sequents, following with a polarised and focused variant that we show is sound and complete via a cut-elimination argument. This establishes an operational semantics for focused proof-search in the logic of Bunched Implications.
| Type: | Proceedings paper |
|---|---|
| Title: | Focused Proof-search in the Logic of Bunched Implications |
| Event: | FOSSACS 2021: Foundations of Software Science and Computation Structures |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-030-71995-1_13 |
| Publisher version: | http://dx.doi.org/10.1007/978-3-030-71995-1_13 |
| Language: | English |
| Additional information: | © The Editor(s) (if applicable) and The Author(s) 2021. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations |
| Keywords: | Logic, Proof-search, Focusing, Bunched Implications |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10128198 |
Archive Staff Only
 |
View Item |
