193 research outputs found
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi
In this paper we give an arithmetical proof of the strong normalization of
lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a
formulae-as-types translation of classical propositional logic in natural
deduction style. Then we give a translation between the
lambda-Sym-Prop-calculus and the lambda-bar-mu-mu-tilde-star-calculus, which is
the implicational part of the lambda-bar-mu-mu-tilde-calculus invented by
Curien and Herbelin [3] extended with negation. In this paper we adapt the
method of David and Nour [4] for proving strong normalization. The novelty in
our proof is the notion of zoom-in sequences of redexes, which leads us
directly to the proof of the main theorem
From delimited CPS to polarisation
Appeared in the author's PhD thesis (Chapter III) along with more details. See (and cite) Guillaume Munch-Maccagnoni, Syntax and Models of a non-Associative Composition of Programs and Proofs, Université Paris-Diderot - Paris VII, 2013, .The understanding of continuation-passing style (CPS) translations, an historical source of denotational semantics for programming languages, benefits from notions brought by linear logic, such as focalisation, polarities and the involutive negation. Here we aim to show how linear logic helps as well when continuations are delimited, i.e. return and can be composed, in the sense of Danvy and Filinski. First we provide a polarised calculus with delimited control (first-class delimited continuations) which is, at the level of computation, a variant of Girard's polarised classical logic LC. It contains variants of delimited control calculi which spawned as answers to the question "what order of evaluation can we consider with delimited control?". Thus our polarised calculus is one answer which is unifying to some degree. Subsequently we decompose the calculus through polarised linear logic. The only difference with non-delimited continuations is the use of specific exponentials, that account for the specific semantics of the target of delimited CPS translation, as well as annotations of type-and-effect systems. As a by-product, we obtain an explanation of CPS translations through a factoring, each step of which accounts for distinct phenomena of CPS translations. Although the factoring also holds for non-delimited CPS translations, it did not appear in its entirety before
Parity, Relevance, and Gentle Explosiveness in the Context of Sylvan's Mate Function
The Routley star, an involutive function between possible worlds or set-ups against which negation is evaluated, is a hallmark feature of Richard Sylvan and Val Plumwood's set-up semantics for the logic of first-degree entailment. Less frequently acknowledged is the weaker mate function described by Sylvan and his collaborators, which results from stripping the requirement of involutivity from the Routley star. Between the mate function and the Routley star, however, lies an broad field of intermediate semantical conditions characterizing an infinite number of consequence relations closely related to first-degree entailment. In this paper, we consider the semantics and proof theory for deductive systems corresponding to set-up models in which the mate function is cyclical. We describe modifications to Anderson and Belnap's consecution calculus LE_fde2 that correspond to these constraints, for which we prove soundness and completeness with respect to the set-up semantics. Finally, we show that a number of familiar metalogical properties are coordinated with the parity of a mate function's period, including refined versions of the variable-sharing property and the property of gentle explosiveness
Implications in bounded systems
Abstract A consistent connective system generated by nilpotent operators is not necessarily isomorphic to Łukasiewicz-system. Using more than one generator function, consistent nilpotent connective systems (so-called bounded systems) can be obtained with the advantage of three naturally derived negations and thresholds. In this paper, implications in bounded systems are examined. Both R- and S-implications with respect to the three naturally derived negations of the bounded system are considered. It is shown that these implications never coincide in a bounded system, as the condition of coincidence is equivalent to the coincidence of the negations, which would lead to Łukasiewicz logic. The formulae and the basic properties of four different types of implications are given, two of which fulfill all the basic properties generally required for implications
Hopeful Monsters : A Note on Multiple Conclusions
Arguments, the story goes, have one or more premises and only one conclusion. A contentious generalisation allows arguments with several disjunctively connected conclusions. Contentious as this generalisation may be, I will argue nevertheless that it is justified. My main claim is that multiple conclusions are epiphenomena of the logical connectives: some connectives determine, in a certain sense, multiple-conclusion derivations. Therefore, such derivations are completely natural and can safely be used in proof-theoretic semantics.info:eu-repo/semantics/publishedVersio
Coherence for Star-Autonomous Categories
This paper presents a coherence theorem for star-autonomous categories
exactly analogous to Kelly's and Mac Lane's coherence theorem for symmetric
monoidal closed categories. The proof of this theorem is based on a categorial
cut-elimination result, which is presented in some detail.Comment: 28 page
Explorations in Subexponential Non-associative Non-commutative Linear Logic
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical one-sided multi-succedent classical analogue of our intuitionistic system, following the exponential-free calculi of Buszkowski, and de Groote, Lamarche. A large fragment of the intuitionistic calculus is shown to embed faithfully into the classical fragment
- …