Abstract
AbstractWe give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason with eigenworlds (i.e., generic representatives of worlds) in an arbitrary model. This reasoning is captured by a sequent calculus for ameta-logic (in this case, first-order classical logic) expressive enough to capture the semantics of the object-logic. Essentially, one has a calculus of validity for the object-logic. The method proceeds through the perspective of reductive logic (as opposed to the more traditional paradigm of deductive logic), using the space of reductions as a medium for showing the behavioural equivalence of reduction in the sequent calculus for the object-logic and in the validity calculus. Rather than study the technique in general, we illustrate it for the logic of Bunched Implications (BI), thus IPL and MILL (without negation) are also treated. Intuitively, BI is the free combination of intuitionistic propositional logic and multiplicative intuitionistic linear logic, which renders its meta-theory is quite complex. The literature on BI contains many similar, but ultimately different, algebraic structures and satisfaction relations that either capture only fragments of the logic (albeit large ones) or have complex clauses for certain connectives (e.g., Beth’s clause for disjunction instead of Kripke’s). It is this complexity that motivates us to use BI as a case-study for this approach to semantics.
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference33 articles.
1. Beth, W.E., Semantic Constructions of Intuitionistic Logic, Mededelingen Der Koninklijke Nederlandse Akademie Vanwetenschappen, Afd. Letterkunde 19(11):357–388, 1956.
2. Brotherston, J., Bunched Logics Displayed, Studia Logica 100(6):1223–1254, 2012.
3. Bundy, A., The Computer Modelling of Mathematical Reasoning, Academic Press Professional Inc., 1985.
4. Cao, Q., S. Cuellar, and A. W. Appel, Bringing Order to the Separation Logic Jungle, in Bor-Yuh Evan Chang, (ed.), Asian Symposium on Programming Languages and Systems – APLAS 15, vol. 10695 of Lecture Notes in Computer Science, Springer, 2017, pp. 190–211.
5. Docherty, S., Bunched Logics: A Uniform Approach, Ph.D. thesis, University College London, 2019.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献