Reductive logic, proof-search, and coalgebra: a perspective from resource semantics

Gheorghiu, Alexander V., Docherty, Simon and Pym, David J. (2023) Reductive logic, proof-search, and coalgebra: a perspective from resource semantics. In, Palmigiano, Alessandra and Sadrzadeh, Mehrnoosh (eds.) Samson Abramsky on Logic and Structure in Computer Science and Beyond. (Outstanding Contributions to Logic, 25) 1 ed. Springer Cham, pp. 833-875. (doi:10.1007/978-3-031-24117-8_23).

Abstract

The reductive, as opposed to deductive, view of logic is the form of logic that is, perhaps, most widely employed in practical reasoning. In particular, it is the basis of logic programming. Here, building on the idea of uniform proof in reductive logic, we give a treatment of logic programming for BI, the logic of bunched implications, giving both operational and denotational semantics, together with soundness and completeness theorems, all couched in terms of the resource interpretation of BI’s semantics. We use this set-up as a basis for exploring how coalgebraic semantics can, in contrast to the basic denotational semantics, be used to describe the concrete operational choices that are an essential part of proof-search. The overall aim, toward which this paper can be seen as an initial step, is to develop a uniform, generic, mathematical framework for understanding the relationship between the deductive structure of logics and the control structures of the corresponding reductive paradigm.

This record has no associated files available for download.

Contributors

Author: Alexander V. Gheorghiu

Download statistics