scholarly journals Proof Theory of Partially Normal Skew Monoidal Categories

2021 ◽  
Vol 333 ◽  
pp. 230-246
Author(s):  
Tarmo Uustalu ◽  
Niccolò Veltri ◽  
Noam Zeilberger
2017 ◽  
Vol 28 (10) ◽  
pp. 1639-1694
Author(s):  
MASAHIRO HAMANO ◽  
PHILIP SCOTT

We present Geometry of Interaction (GoI) models for Multiplicative Polarized Linear Logic, MLLP, which is the multiplicative fragment of Olivier Laurent's Polarized Linear Logic. This is done by uniformly adding multi-points to various categorical models of GoI. Multi-points are shown to play an essential role in semantically characterizing the dynamics of proof networks in polarized proof theory. For example, they permit us to characterize the key feature of polarization, focusing, as well as being fundamental to our construction of concrete polarized GoI models.Our approach to polarized GoI involves following two independent studies, based on different categorical perspectives of GoI: (i)Inspired by the work of Abramsky, Haghverdi and Scott, a polarized GoI situation is defined in which multi-points are added to a traced monoidal category equipped with a reflexive object U. Using this framework, categorical versions of Girard's execution formula are defined, as well as the GoI interpretation of MLLP proofs. Running the execution formula is shown to characterize the focusing property (and thus polarities) as well as the dynamics of cut elimination.(ii)The Int construction of Joyal–Street–Verity is another fundamental categorical structure for modelling GoI. Here, we investigate it in a multi-pointed setting. Our presentation yields a compact version of Hamano–Scott's polarized categories, and thus denotational models of MLLP. These arise from a contravariant duality between monoidal categories of positive and negative objects, along with an appropriate bimodule structure (representing ‘non-focused proofs’) between them.Finally, as a special case of (ii) above, a compact model of MLLP is also presented based on Rel (the category of sets and relations) equipped with multi-points.


Author(s):  
Sara Negri ◽  
Jan von Plato ◽  
Aarne Ranta

Author(s):  
A. S. Troelstra ◽  
H. Schwichtenberg
Keyword(s):  

Author(s):  
J. R. B. Cockett ◽  
R. A. G. Seely

This chapter describes the categorical proof theory of the cut rule, a very basic component of any sequent-style presentation of a logic, assuming a minimum of structural rules and connectives, in fact, starting with none. It is shown how logical features can be added to this basic logic in a modular fashion, at each stage showing the appropriate corresponding categorical semantics of the proof theory, starting with multicategories, and moving to linearly distributive categories and *-autonomous categories. A key tool is the use of graphical representations of proofs (“proof circuits”) to represent formal derivations in these logics. This is a powerful symbolism, which on the one hand is a formal mathematical language, but crucially, at the same time, has an intuitive graphical representation.


1987 ◽  
Vol 10 (4) ◽  
pp. 387-413
Author(s):  
Irène Guessarian

This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.


2020 ◽  
Vol 21 (4) ◽  
pp. 1-31
Author(s):  
Liron Cohen ◽  
Reuben N. S. Rowe

2018 ◽  
Vol 506 ◽  
pp. 237-266 ◽  
Author(s):  
John Bourke ◽  
Stephen Lack
Keyword(s):  

2014 ◽  
Vol 64 (4) ◽  
pp. 893-909
Author(s):  
Shiyin Zhao ◽  
Jing Wang ◽  
Hui-Xiang Chen

Sign in / Sign up

Export Citation Format

Share Document