Partially commutative linear logic: sequent calculus and phase semantics
|
|
- Willa Daniel
- 6 years ago
- Views:
Transcription
1 Partially commutative linear logic: sequent calculus and phase semantics Philippe de Groote Projet Calligramme INRIA-Lorraine & CRIN CNRS 615 rue du Jardin Botanique - B.P. 101 F Villers-lès-Nancy Cedex FRANCE Philippe.de.Groote@loria.fr We define a variant of intuitionistic multiplicative linear logic that features the noncommutative connectives of the Lambek calculus together with the usual commutative connectives of linear logic. We give a sequent calculus, define a notion of phase space, and prove the completeness of the sequent calculus with respect to the phase semantics. 1 Introduction In this short paper we introduce a variant of intuitionistic multiplicative linear logic that features both commutative and non-commutative connectives. This new logic extends conservatively both Girard s multiplicative linear logic [2] and Lambek s syntactic calculus [3]. Ultimately, our goal will be to fulfil the programme achieved by Girard in [2], i.e., to provide our system with: (1) a sequent calculus, (2) a proof-net syntax together with a correctness criterion and a sequentialisation theorem, (3) semantics of provability together with a completeness theorem, (4) denotational semantics, i.e., semantics of proofs. Nevertheless, in this first report, we only concentrate on (1) and (3). Related works on mixing commutativity and non-commutativity in linear logic include [1] and [5]. 2 Formal system 2.1 Formulas and sequents The formulas of our system are built from a set V of propositional variables (or atomic formulas), according to the definition that follows. Definition 1 (Fromula) The set F of formulas obeys the following grammar: F ::= V (F F) (F F) (F F) (F F) (F F)
2 As it will be clear from the sequent calculus, the connectives (tensor) and (implication) are commutative. They correspond exactly to Girard s multiplicative conjunction and implication [2], which justifies the notation. The other connectives, namely, (product), (direct implication), and (retro implication) are non-commutative. They correspond to Lambek s conjunction and implications [3]. More precisely, formulas of the form (A B), (A B), and (A B) correspond respectively to (A B), (A\B), and (A/B) in Lambek s notation. The fact that we are dealing with two sorts of conjunctions (a commutative one and a non-commutative one) is reflected at the level of the sequents that are built by means of two meta-connectives:, (parallel composition) and ; (serial composition). The precise definition of sequent is as follows. Definition 2 (Sequent) The set S of sequents is inductively defined as follows: S ::= H F H ::= () H 0 H 0 ::= F (H 0, H 0 ) (H 0 ; H 0 ) H and H 0 are respectively the set of antecedents (or sequences of hypotheses) and the set of non-empty antecedents (or non-empty sequences of hypotheses). () is the empty antecedent. We use the following notational conventions. Roman uppercases (A, B,...) denote formulas while Greek uppercases (Γ,,...), possibly with subscripts, denote (possibly empty) antecedents. If Γ denotes the empty antecedent then (Γ, ), (, Γ), (Γ; ), and ( ; Γ) denote the the antecedent denoted by. In other words, the empty antecedent acts as the identity element of the parallel and serial compositions. Usually, we do not write the empty antecedent: we write A instead of () A. We also use a square bracket notation to denote contexts, i.e., antecedents with one hole. Then, if Γ[ ] denotes such a context and denotes a non-empty antecedent, Γ[ ] denotes the antecedent obtained by filling the hole with. We omit the formal definition that would rely on the notion of binary tree. 2.2 Sequent calculus Following Girard, we organize our sequent calculus into three groups of rules: the structural rules, the identity rules, and the logical rules. The first four structural rules (pa1, pa2, sa1, sa2) express that both the parallel and serial compositions are associative. The next one (pc) says that the parallel composition is commutative. Consequently, the tensor ( ) is associative and commutative while the product ( ) is only associative. Finally, there is an entropy rule (ent) that specifies that the parallel composition is weaker than the serial composition. As a consequence, the formula (A B) (A B) is provable. The logical and identity rules are as usual. Structural rules Γ[(( 1, 2 ), 3 )] A Γ[( 1, ( 2, 3 ))] A (pa1) Γ[( 1, ( 2, 3 ))] A Γ[(( 1, 2 ), 3 )] A (pa2)
3 Γ[(( 1 ; 2 ); 3 )] A Γ[( 1 ; ( 2 ; 3 ))] A (sa1) Γ[( 1 ; ( 2 ; 3 ))] A Γ[(( 1 ; 2 ); 3 )] A (sa2) Γ[( 1, 2 )] A Γ[( 2, 1 )] A Identity rules A A (id) Logical rules (pc) Γ[( 1 ; 2 )] A Γ[( 1, 2 )] A Γ A [A] B (cut) [Γ] B (ent) Γ[(A, B)] C Γ[(A B)] C (tl) Γ A B (tr) (Γ, ) A B Γ A [B] C [(Γ, A B)] C (il) Γ[(A; B)] C Γ[(A B)] C (pl) Γ A [B] C [(Γ; A B)] C (dl) Γ A [B] C [(B A; Γ)] C (rl) (A, Γ) B Γ A B (ir) Γ A B (pr) (Γ; ) A B (A; Γ) B Γ A B (Γ; A) B Γ B A (dr) (rr) We write (Γ A) when the sequent Γ A is provable with respect to the above rules. When it is provable without using Rule (cut), i.e., provable in the cut-free calculus, we write cf (Γ A). It is almost immediate to establish that the above calculus satisfies the cut elimination property. 1 Then, one may easily establish, as a corollary of the subformula property, that our calculus is a conservative extension of both Lambek s and Girard s intuitionistic multiplicative calculi. We end this section by establishing two technical lemmas that will be needed in the sequel. Lemma 3 The following properties hold: 1. cf (Γ[(A, B)] C) if and only if cf (Γ[(A B)] C). 2. cf (Γ[(A; B)] C) if and only if cf (Γ[(A B)] C). 3. cf ((A, Γ) B) if and only if cf (Γ (A B)). 4. cf ((A; Γ) B) if and only if cf (Γ (A B)). 1 In fact, cut elimination is a consequence of the completeness theorem of Section 3.3 because we establish the soudness of the cut rule, on the one hand, and the completeness of the cut-free calculus, on the other hand. But this is quite a détour with respect to the direct syntactic proof.
4 5. cf ((Γ; A) B) if and only if cf (Γ (B A)). Proof. The only if parts of these five equivalences are obvious since they correspond to Rules (tl), (pl), (ir), (dr) and (rr). The if parts are established by routine inductions. Lemma 4 Let Γ be an antecedent and γ be the formula obtained by replacing in Γ each occurrence of ; by and each occurrence of, by. 1. cf ((Γ, ) A) if and only if cf ( (γ A)). 2. cf ((Γ; ) A) if and only if cf ( (γ A)). 3. cf (( ; Γ) A) if and only if cf ( (A γ)). Proof. By iterating Lemma 3. 3 Phase semantics 3.1 Definition Phase spaces for the multiplicative intutionistic fragment of Girard s linear logic are made of commutative monoids while phase spaces for Lambek s syntactic calculus are made of non-commutative ones. Here, we consider sets with two monoidal products: a commutative one, and a non-commutative one. These sets, in addition, are partially ordered. This allows the consequence relation existing between the commutative and the non-commutative connectives to be taken into account. The exact definition of our notion of phase space is the following. Definition 5 (Phase space) A phase space P = M,,,, 1, F is a structure such that: 1. M, is a poset; 2. M,, 1 is a monoid; 3. M,, 1 is a commutative monoid; 4. a, b, c, d M: (a) if a b, c d then a c b d, (b) if a b, c d then a c b d, (c) a b a b; 5. F, which is called the set of facts, is a set of subsets of M; 6. each fact is an order ideal, i.e., F F, a F, b M, if b a then b F ; 7. the set of facts F is closed by arbitrary intersection; 8. M F; 9. a M, F F:
5 (a) G F, b M, a b F iff b G, (b) G F, b M, b a F iff b G, (c) G F, b M, a b F iff b G. As usual, the formulas will be interpreted as facts, i.e., as subsets of M. To this end, we introduce operations on subsets that will allow the different connective to be interpreted. Definition 6 (Operations on subsets of M) Let P = M,,,, 1, F be a phase space. Let A, B M. We define the following operations: 1. A B := {x M : a A, b B, x = a b}; 2. A B := {x M : a A, b B, x = a b}; 3. A B := {x M : a A, a x B}; 4. B A := {x M : a A, x a B}; 5. A B := {x M : a A, a x B}; 6. C F A := {F F : A F }. The following lemma state some fundamental properties of the above operations. Lemma 7 Let P = M,,,, 1, F be a phase space and A, B, C, D M. 1. A B C if and only if B (A C). 2. A B C if and only if A (C B). 3. A B C if and only if B (A C). 4. if A C and B D then (A B) (C D). 5. if A C and B D then (A B) (C D). 6. (A B) C F (A B). Proof. Properties 1 to 5 are direct consequences of Definition 6. Property 6 follows from Conditions 4.c and 6 in Definition 5. Condition 9 in Definition 5 ensures that whenever F is a fact so are (A F ), (F A), and (A F ). This property is established by the next lemma. Lemma 8 Let P = M,,,, 1, F be a phase space. If A M, and F F then: 1. A F F; 2. F A F; 3. A F F.
6 Proof. We prove Property 1, the proofs of properties 2 and 3 being similar. Since the set of facts is closed by arbitrary intersection, we have that for any X M, C F X is the smallest fact containing X. Consequently, any X M is a fact if and only if C F X X. Therefore, we have to show that C F (A F ) (A F ). Suppose that x C F (A F ) or, equivalently, suppose that: H F, if (A F ) H then x H (a) Suppose also that a A, we have to show that a x F. Now, by Condition 9.a in Definition 5, there exists G F such that: y M, a y F iff y G (b) By instantiating H with G in (a), we obtain: Then, using (b), we obtain: if (A F ) G then x G if (A F ) G then a x F, and it remains to show that (A F ) G. To this end, suppose that z (A F ), i.e., a A, a z F. Since a A, we have that a z F. Then, by (b), we have that z G. As we stressed in the preceeding proof, C F is the operator that yields the smallest fact containing a given subset. In fact, Conditions 7 and 8 in Definition 5 stipulates that F is a topped -structure, and C F is the closure operator to which that structure gives rise. This is stated by the following lemma. Lemma 9 Let P = M,,,, 1, F be a phase space. If A, B M then: 1. A C F A; 2. if A B then C F A C F B; 3. C F C F A C F A; 4. (C F A C F B) C F (A B); 5. (C F A C F B) C F (A B). Proof. Properties 1 to 3, which are the definitional properties of a closure operator, are obvious. We only prove Property 4, the proof of Property 5 being similar. By Property 1, we have that (A B) C F (A B). Then, by Lemma 7, we have that B (A C F (A B)) and, using Property 2, we obtain that C F B C F (A C F (A B)). Now, by Lemma 8, (A C F (A B)) is a fact and, consequently, C F (A C F (A B)) = (A C F (A B)). This implies that C F B (A C F (A B)) and, using Lemma 7, that (A C F B) C F (A B). From this, by a similar reasoning, we obtain that C F A (C F (A B) C F B). Finally, using again Lemma 7, we conclude that (C F A C F B) C F (A B). We are now in the position of defining the interpretation of the formulas.
7 Definition 10 (Interpretation) Let P = M,,,, 1, F be a phase space. Let η : V F be a valuation that assigns a fact to each atomic formula. We inductively define the interpereation [[A]]η of a formula A as follows: 1. [[a]]η := η(a); 2. [[A B]]η := C F ([[A]]η [[B]]η); 3. [[A B]]η := C F ([[A]]η [[B]]η); 4. [[A B]]η := [[A]]η [[B]]η; 5. [[A B]]η := [[A]]η [[B]]η; 6. [[A B]]η := [[A]]η [[B]]η. We define the interpereation [[Γ]]η of an antecedent Γ similarly: 1. [[(Γ, )]]η := C F ([[Γ]]η [[ ]]η); 2. [[(Γ; )]]η := C F ([[Γ]]η [[ ]]η). Finally, we define the interpretation of a sequent as follows: where [[Γ]]η = {1} when Γ is empty. [[Γ A]]η := [[Γ]]η [[A]]η, Remark that Lemma 8 implies that the interpretation of any formula, context, or sequent is a fact. The notion of validity is defined as usual. Definition 11 (Validity) Let P = M,,,, 1, F be a phase space, and let η : A F be a valuation. 1. P, η = (Γ A) if and only if 1 [[Γ A]]η. (η satifies the sequent Γ A.) 2. P = (Γ A) if and only P, ρ = (Γ A) for any valuation ρ. (The sequent Γ A is valid in P.) 3. = (Γ A) if and only Q = (Γ A) for any phase space Q. (The sequent Γ A is valid.) 3.2 Soundness Formulas are interpreted by facts that are partially ordered by set inclusion. This inclusion order, which corresponds to a consequence relation, allows another characterization of validity to be given. Lemma 12 Let P = M,,,, 1, F be a phase space and η be a valuation. P, η = (Γ A) if and only if [[Γ]]η [[A]]η. Proof. 1 [[Γ A]]η iff γ [[Γ]]η, 1 γ [[A]]η iff γ [[Γ]]η, γ [[A]]η.
8 We now prove that the interpretation given in Definition 11 is sound. To this end, we state several lemmas. Their proofs, which are easy to establish using Lemmas 7 and 9, are left to the reader. Lemma 13 Let P = M,,,, 1, F be a phase space and let η be a valuation. The following properties hold: 1. [[(( 1 ; 2 ); 3 )]]η = [[( 1 ; ( 2 ; 3 ))]]η; 2. [[(( 1, 2 ), 3 )]]η = [[( 1, ( 2, 3 ))]]η; 3. [[( 1, 2 )]]η = [[( 2, 1 )]]η; 4. [[( 1, 2 )]]η [[( 1 ; 2 )]]η; 5. [[ 1 ]]η [[ 2 ]]η implies that [[Γ[ 1 ]]]η [[Γ[ 2 ]]]η. Lemma 14 Let P = M,,,, 1, F be a phase space and let η be a valuation. The following properties hold: 1. [[(A; A B)]]η [[B]]η; 2. [[(A B; B)]]η [[A]]η; 3. [[(A, A B)]]η [[B]]η. Theorem 15 (Soundness) (Γ A) implies that = (Γ A). Proof. A straightforward induction on the derivation of Γ A, using Lemmas 12, 13, and Completeness In this section, we prove the converse of Theorem 15: any valid sequent is derivable. Our proof, which is adapted from [4], undertakes the usual construction of a syntactic phase S = M S, S, S, S, 1 S, F S in which the notions of provability and validity coincide: 1. The set M S is the set of contexts modulo the associativity law of serial composition, and the associativity and commutativity laws of parallel composition. The two monoidal products S and S correspond respectively to serial composition ; and parallel composition,. The identity element is the empty context. 2. The partial order S is defined to be the least order such that: (a) if 1 S Γ 1 and 2 S Γ 2 then ( 1 ; 2 ) S (Γ 1 ; Γ 2 ), (b) if 1 S Γ 1 and 2 S Γ 2 then ( 1, 2 ) S (Γ 1, Γ 2 ), (c) (, Γ 1 ) S ( ; Γ 1 ); 3. For each formula A, we define [A] := {Γ : cf (Γ A)}. The set of facts F S is defined to be the least set such that: (a) [A] F S, for any formula A,
9 (b) M S F S, (c) F S is closed by arbitrary intersection. We must now check that the above contruction gives rise to a phase space. Lemma 16 space. The structure S = M S, S, S, S, 1 S, F S defined as above is a phase Proof. Conditions 1 to 5, Condition 7, and Condition 8 of Definition 5 are satisfied by construction. Condition 6, which stipulates that each fact must be an order ideal is also satisfied because of Rule (ent). Therefore, it remains to show that Condition 9 is satisfied. We only prove 9.a, the proofs of 9.b and 9.c being similar. Let Γ M S and let F F S. If F = M S then we take G = M S. Otherwise, there exists a family A of formulas such that F = A A [A]. Let γ be the formula obtained by replacing in Γ each occurrence of ; by and each occurrence of, by. Then, consider G = A A [γ A]. By Lemma 4, we have that for any A A, cf (Γ; A) if and only if cf ( γ A). From this, we conclude that for all M S, A A, cf (Γ; A) if and only if A A, cf ( γ A). We are now in the position of establishing that validity in the phase space S implies provability. Lemma 17 Let η be the valuation that assigns the fact [a] to each atomic formula a and write simply [[A]] for [[A]]η. For any formula A, the following holds: 1. [[A]] [A]; 2. A [[A]]. Proof. Preliminary remark: Property 1 implies that the interpretation of each formula is contained in at least one fact of the form [D]. Therefore, for each formula A, there exists a family of formula A such that [[A]] = C A [D], since the interpretation of any formula is a fact. We will use this property when establishing Property 2. The proof is by induction on the structure of A. For the base case, Property 1 holds by definition of the valuation, and Property 2 holds because of the axiom (id). We only give the inductive cases corresponding to the connectives and, the others being similar. A B C. Suppose Γ [[B C]]. By definition, this means that for any fact F such that [[B]] S [[C]] F, we have Γ F. In particular, consider the fact [B C]. We obtain that if [[B]] S [[C]] [B C] then Γ [B C]. Therefore, it remains to show that [[B]] S [[C]] [B C]. To this end, suppose Γ 1 [[B]] and Γ 2 [[C]]. By induction hypothesis, we have Γ 1 [B] and Γ 2 [C], which implies cf (Γ 1 B) and cf (Γ 2 C). Hence, by Rule (pr), we obtain cf (Γ 1 ; Γ 2 B C), which implies (Γ 1 ; Γ 2 ) [B C]. This establishes Property 1. To establish Property 2, we must show that B C F S ([[B]] S [[C]]). According to the prelimnary remark, it is sufficient to show that for any formula D such that [[B]] S [[C]] [D], we have B C [D]. Now, by induction hypothesis, B [[B]] and C [[C]]. Therefore, for any formula D such that [[B]] S [[C]] [D], we have B; C [D]. This
10 means that cf (B; C D). Hence, by Rule (pl), cf (B C D), which implies B C [D]. A B C. Suppose Γ [[B C]]. By definition, this means that for all [[B]], ( ; Γ) [[C]]. By induction hypothesis, B [[B]]. Hence, (B; Γ) [[C]]. By induction hypothesis again, [[C]] [C]. This implies B; Γ [C], which means cf (B; Γ C). Then, using Rule (dr), we obtain cf (Γ B C), which establishes that Γ [B C]. To establish Property 2, we must show that Γ [[B]], (Γ; B C) [[C]]. Suppose Γ [[B]]. By induction hypothesis, [[B]] [B], which implies: cf (Γ B) (a) Now, according to the preliminary remark, in order to show that (Γ; B C) [[C]], we may suppose [[C]] [D] and show that (Γ; B C) [D]. By induction hypothesis, C [[C]]. This implies C [D], which means that: cf (C D) (b) From (a), and (b), using Rule (dl), we obtain cf (Γ; B C D), which establishes that (Γ; B C) [D]. Theorem 18 (Completeness) The following statements are equivalent: 1. = (Γ A) 2. cf (Γ A) 3. (Γ A) Proof. We have that 2 implies 3 trivially and that 3 implies 1 by Theorem 15. To show that 1 implies 2, suppose that = (Γ A). This means, by Lemma 12, that [[Γ]]η [[A]]η for any phase space P and any valuation η. In particular, this inclusion holds for the syntactic phase space S and the valuation of Lemma 17. Then, by Lemma 17, Property 1, we have [[A]] [A], which consequently implies [[Γ]] [A]. On the other hand, as a consequence of Lemma 17, Property 2, we have that Γ [[Γ]]. Therefore, we have Γ [A], which implies cf (Γ A). References [1] V. M. Abrusci. Estensione della logica lineare non commutativa. Centro Interdipartementale di Logica e Applicazioni, Università di Bari, [2] J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1 102, [3] J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65: , [4] M. Okada. Girard s phase space semantics and higher order cut elimination proof. Working paper, [5] Ch. Retoré. Réseaux et Séquents Ordonnés. Thèse de Doctorat, spécialité Mathématiques, Université Paris 7, 1993.
Preuves de logique linéaire sur machine, ENS-Lyon, Dec. 18, 2018
Université de Lorraine, LORIA, CNRS, Nancy, France Preuves de logique linéaire sur machine, ENS-Lyon, Dec. 18, 2018 Introduction Linear logic introduced by Girard both classical and intuitionistic separate
More informationEquivalent Types in Lambek Calculus and Linear Logic
Equivalent Types in Lambek Calculus and Linear Logic Mati Pentus Steklov Mathematical Institute, Vavilov str. 42, Russia 117966, Moscow GSP-1 MIAN Prepublication Series for Logic and Computer Science LCS-92-02
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationLambek calculus is NP-complete
Lambek calculus is NP-complete Mati Pentus May 12, 2003 Abstract We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L the derivability problem is NP-complete.
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationFROM PROOF NETS TO THE FREE -AUTONOMOUS CATEGORY
Logical Methods in Computer Science Vol. 2 (4:3) 2006, pp. 1 44 www.lmcs-online.org Submitted Nov. 3, 2005 Published Oct. 5, 2006 FROM PROOF NETS TO THE FREE -AUTONOMOUS CATEGORY FRANÇOIS LAMARCHE a AND
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationOn rigid NL Lambek grammars inference from generalized functor-argument data
7 On rigid NL Lambek grammars inference from generalized functor-argument data Denis Béchet and Annie Foret Abstract This paper is concerned with the inference of categorial grammars, a context-free grammar
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationA completeness theorem for symmetric product phase spaces
A completeness theorem for symmetric product phase spaces Thomas Ehrhard Fédération de Recherche des Unités de Mathématiques de Marseille CNRS FR 2291 Institut de Mathématiques de Luminy CNRS UPR 9016
More informationadmissible and derivable rules in intuitionistic logic
admissible and derivable rules in intuitionistic logic Paul Rozière Equipe de Logique, CNRS UA 753 Université Paris 7 2 place Jussieu, 75230 PARIS cedex 05 roziere@logique.jussieu.fr preliminary draft,
More informationComplexity of the Lambek Calculus and Its Fragments
Complexity of the Lambek Calculus and Its Fragments Mati Pentus Department of Mathematical Logic and Theory of Algorithms Faculty of Mechanics and Mathematics Moscow State University 119991, Moscow, Russia
More informationDisplay calculi in non-classical logics
Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi
More informationCanonical Calculi: Invertibility, Axiom expansion and (Non)-determinism
Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic
More informationhal , version 1-21 Oct 2009
ON SKOLEMISING ZERMELO S SET THEORY ALEXANDRE MIQUEL Abstract. We give a Skolemised presentation of Zermelo s set theory (with notations for comprehension, powerset, etc.) and show that this presentation
More informationInvestigation of Prawitz s completeness conjecture in phase semantic framework
Investigation of Prawitz s completeness conjecture in phase semantic framework Ryo Takemura Nihon University, Japan. takemura.ryo@nihon-u.ac.jp Abstract In contrast to the usual Tarskian set-theoretic
More informationA simple proof that super-consistency implies cut elimination
A simple proof that super-consistency implies cut elimination Gilles Dowek 1 and Olivier Hermant 2 1 École polytechnique and INRIA, LIX, École polytechnique, 91128 Palaiseau Cedex, France gilles.dowek@polytechnique.edu
More informationForcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus Hugo Herbelin 1 and Gyesik Lee 2 1 INRIA & PPS, Paris Université 7 Paris, France Hugo.Herbelin@inria.fr 2 ROSAEC center,
More informationCompleteness Theorems and λ-calculus
Thierry Coquand Apr. 23, 2005 Content of the talk We explain how to discover some variants of Hindley s completeness theorem (1983) via analysing proof theory of impredicative systems We present some remarks
More informationIntroduction to Intuitionistic Logic
Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationAN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC
Bulletin of the Section of Logic Volume 45/1 (2016), pp 33 51 http://dxdoiorg/1018778/0138-068045103 Mirjana Ilić 1 AN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC Abstract
More informationPROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS
PROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS Karim NOUR 1 and Abir NOUR 2 Abstract In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic
More informationTR : Binding Modalities
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2012 TR-2012011: Binding Modalities Sergei N. Artemov Tatiana Yavorskaya (Sidon) Follow this and
More informationSilvio Valentini Dip. di Matematica - Università di Padova
REPRESENTATION THEOREMS FOR QUANTALES Silvio Valentini Dip. di Matematica - Università di Padova Abstract. In this paper we prove that any quantale Q is (isomorphic to) a quantale of suitable relations
More informationOn Sequent Calculi for Intuitionistic Propositional Logic
On Sequent Calculi for Intuitionistic Propositional Logic Vítězslav Švejdar Jan 29, 2005 The original publication is available at CMUC. Abstract The well-known Dyckoff s 1992 calculus/procedure for intuitionistic
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationSystems of modal logic
499 Modal and Temporal Logic Systems of modal logic Marek Sergot Department of Computing Imperial College, London utumn 2008 Further reading: B.F. Chellas, Modal logic: an introduction. Cambridge University
More informationA Propositional Dynamic Logic for Instantial Neighborhood Semantics
A Propositional Dynamic Logic for Instantial Neighborhood Semantics Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist Abstract We propose a new perspective on logics of computation by combining
More informationStructures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity Pietro Di Gianantonio dipartimento di Matematica e Informatica, Università di Udine via delle Scienze 206 I-33100, Udine Italy e-mail:
More informationProof Theoretical Studies on Semilattice Relevant Logics
Proof Theoretical Studies on Semilattice Relevant Logics Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp
More informationOn the Construction of Analytic Sequent Calculi for Sub-classical Logics
On the Construction of Analytic Sequent Calculi for Sub-classical Logics Ori Lahav Yoni Zohar Tel Aviv University WoLLIC 2014 On the Construction of Analytic Sequent Calculi for Sub-classical Logics A
More informationFirst-Order Logic. Chapter Overview Syntax
Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts
More informationProof nets sequentialisation in multiplicative linear logic
Annals of Pure and Applied Logic 155 (2008) 173 182 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Proof nets sequentialisation
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationMarie Duží
Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language
More informationAutomated Support for the Investigation of Paraconsistent and Other Logics
Automated Support for the Investigation of Paraconsistent and Other Logics Agata Ciabattoni 1, Ori Lahav 2, Lara Spendier 1, and Anna Zamansky 1 1 Vienna University of Technology 2 Tel Aviv University
More informationA SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract
Bulletin of the Section of Logic Volume 33/1 (2004), pp. 11 21 Katsumi Sasaki 1 Shigeo Ohama A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2 Abstract To discuss Rosser sentences, Guaspari and Solovay
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationLinear Logic Pages. Yves Lafont (last correction in 2017)
Linear Logic Pages Yves Lafont 1999 (last correction in 2017) http://iml.univ-mrs.fr/~lafont/linear/ Sequent calculus Proofs Formulas - Sequents and rules - Basic equivalences and second order definability
More informationKrivine s Intuitionistic Proof of Classical Completeness (for countable languages)
Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera
More informationThe non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω
1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the
More informationA Proof of the Focusing Property of Linear Logic
A Proof of the Focusing Property of Linear Logic Olivier LAURENT Laboratoire de l Informatique du Parallélisme (UMR 5668) Université de Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1 46, allée
More informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More informationREPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES
Wojciech Buszkowski REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES Professor Rasiowa [HR49] considers implication algebras (A,, V ) such that is a binary operation on the universe A and V A. In particular,
More informationA REGULAR SEQUENT CALCULUS FOR QUANTUM LOGIC IN WHICH A AND v ARE DUAL N.J. CUTLAND GIBBINS
A REGULAR SEQUENT CALCULUS FOR QUANTUM LOGIC IN WHICH A AND v ARE DUAL N.J. CUTLAND GIBBINS Introduction In the paper[ Nishimura (1980)1 the author develops sequent calculi GO and GOM f o r orthologic
More informationLecture Notes on Sequent Calculus
Lecture Notes on Sequent Calculus 15-816: Modal Logic Frank Pfenning Lecture 8 February 9, 2010 1 Introduction In this lecture we present the sequent calculus and its theory. The sequent calculus was originally
More informationFrom pre-models to models
From pre-models to models normalization by Heyting algebras Olivier HERMANT 18 Mars 2008 Deduction System : natural deduction (NJ) first-order logic: function and predicate symbols, logical connectors:,,,,
More informationRelating Reasoning Methodologies in Linear Logic and Process Algebra
Relating Reasoning Methodologies in Linear Logic and Process Algebra Yuxin Deng Robert J. Simmons Iliano Cervesato December 2011 CMU-CS-11-145 CMU-CS-QTR-111 School of Computer Science Carnegie Mellon
More informationInducing syntactic cut-elimination for indexed nested sequents
Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination
More informationMeeting a Modality? Restricted Permutation for the Lambek Calculus. Yde Venema
Meeting a Modality? Restricted Permutation for the Lambek Calculus Yde Venema Abstract. This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzen-style proof
More informationLecture Notes on Linear Logic
Lecture Notes on Linear Logic 15-816: Modal Logic Frank Pfenning Lecture 23 April 20, 2010 1 Introduction In this lecture we will introduce linear logic [?] in its judgmental formulation [?,?]. Linear
More informationSubtractive Logic. To appear in Theoretical Computer Science. Tristan Crolard May 3, 1999
Subtractive Logic To appear in Theoretical Computer Science Tristan Crolard crolard@ufr-info-p7.jussieu.fr May 3, 1999 Abstract This paper is the first part of a work whose purpose is to investigate duality
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationJustification logic for constructive modal logic
Justification logic for constructive modal logic Sonia Marin With Roman Kuznets and Lutz Straßburger Inria, LIX, École Polytechnique IMLA 17 July 17, 2017 The big picture The big picture Justification
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationZoran Petrić. 270 Minutes on Categorial Proof Theory
Zoran Petrić 270 Minutes on Categorial Proof Theory Abstract. The aim of these notes is to provide an introduction of basic categorial notions to a reader interested in logic and proof theory. The first
More informationThe faithfulness of atomic polymorphism
F Ferreira G Ferreira The faithfulness of atomic polymorphism Abstract It is known that the full intuitionistic propositional calculus can be embedded into the atomic polymorphic system F at, a calculus
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationAn Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics (full version)
MFPS 2010 An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics (full version) Dominique Larchey-Wendling LORIA CNRS, UMR 7503 Vandœuvre-lès-Nancy, France
More informationThe Logic of Proofs, Semantically
The Logic of Proofs, Semantically Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: fitting@lehman.cuny.edu web page:
More informationBruno DINIS and Gilda FERREIRA INSTANTIATION OVERFLOW
RPORTS ON MATHMATICAL LOGIC 51 (2016), 15 33 doi:104467/20842589rm160025279 Bruno DINIS and Gilda FRRIRA INSTANTIATION OVRFLOW A b s t r a c t The well-known embedding of full intuitionistic propositional
More informationAN INTRODUCTION TO SEPARATION LOGIC. 2. Assertions
AN INTRODUCTION TO SEPARATION LOGIC 2. Assertions John C. Reynolds Carnegie Mellon University January 7, 2011 c 2011 John C. Reynolds Pure Assertions An assertion p is pure iff, for all stores s and all
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationPropositional Logic. CS 3234: Logic and Formal Systems. Martin Henz and Aquinas Hobor. August 26, Generated on Tuesday 31 August, 2010, 16:54
Propositional Logic CS 3234: Logic and Formal Systems Martin Henz and Aquinas Hobor August 26, 2010 Generated on Tuesday 31 August, 2010, 16:54 1 Motivation In traditional logic, terms represent sets,
More information7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and
7 RC Simulates RA. We now show that DRC (and hence TRC) is at least as expressive as RA. That is, given an RA expression E that mentions at most C, there is an equivalent DRC expression E that mentions
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More informationCyclic Proofs for Linear Temporal Logic
Cyclic Proofs for Linear Temporal Logic Ioannis Kokkinis Thomas Studer Abstract Annotated sequents provide an elegant approach for the design of deductive systems for temporal logics. Their proof theory,
More informationA Remark on Propositional Kripke Frames Sound for Intuitionistic Logic
A Remark on Propositional Kripke Frames Sound for Intuitionistic Logic Dmitrij Skvortsov All-Russian Institute of Scientific and Technical Information, VINITI Russian Academy of Science Usievicha, 20,
More informationOrthogonality and Boolean Algebras for Deduction Modulo
Orthogonality and Boolean Algebras for Deduction Modulo Aloïs Brunel 1, Olivier Hermant 2, and Clément Houtmann 3 1 ENS de Lyon, Alois.Brunel@ens-lyon.org 2 ISEP, Olivier.Hermant@isep.fr 3 INRIA Saclay,
More informationNon-classical Logics: Theory, Applications and Tools
Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.
More informationDual-Intuitionistic Logic and Some Other Logics
Dual-Intuitionistic Logic and Some Other Logics Hiroshi Aoyama 1 Introduction This paper is a sequel to Aoyama(2003) and Aoyama(2004). In this paper, we will study various proof-theoretic and model-theoretic
More informationusual one uses sequents and rules. The second one used special graphs known as proofnets.
Math. Struct. in omp. Science (1993), vol. 11, pp. 1000 opyright c ambridge University Press Minimality of the orrectness riterion for Multiplicative Proof Nets D E N I S B E H E T RIN-NRS & INRILorraine
More information1. Tarski consequence and its modelling
Bulletin of the Section of Logic Volume 36:1/2 (2007), pp. 7 19 Grzegorz Malinowski THAT p + q = c(onsequence) 1 Abstract The famous Tarski s conditions for a mapping on sets of formulas of a language:
More informationExtended Abstract: Reconsidering Intuitionistic Duality
Extended Abstract: Reconsidering Intuitionistic Duality Aaron Stump, Harley Eades III, Ryan McCleeary Computer Science The University of Iowa 1 Introduction This paper proposes a new syntax and proof system
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationPrefixed Tableaus and Nested Sequents
Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu
More informationLabel-free Modular Systems for Classical and Intuitionistic Modal Logics
Label-free Modular Systems for Classical and Intuitionistic Modal Logics Sonia Marin ENS, Paris, France Lutz Straßburger Inria, Palaiseau, France Abstract In this paper we show for each of the modal axioms
More informationOn Modal Logics of Partial Recursive Functions
arxiv:cs/0407031v1 [cs.lo] 12 Jul 2004 On Modal Logics of Partial Recursive Functions Pavel Naumov Computer Science Pennsylvania State University Middletown, PA 17057 naumov@psu.edu June 14, 2018 Abstract
More informationLecture Notes on Ordered Logic
Lecture Notes on Ordered Logic 15-317: Constructive Logic Frank Pfenning Lecture 21 November 16, 2017 1 Introduction In this lecture we first review ordered inference with two new examples: a finite state
More informationProving Completeness for Nested Sequent Calculi 1
Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationCommutative Locative Quantifiers for Multiplicative Linear Logic
Commutative Locative Quantifiers for Multiplicative Linear Logic Stefano Guerrini 1 and Patrizia Marzuoli 2 1 Dipartimento di Informatica Università degli Studi Roma La Sapienza Via Salaria, 113 00198
More informationTEST GROUPS FOR WHITEHEAD GROUPS
TEST GROUPS FOR WHITEHEAD GROUPS PAUL C. EKLOF, LÁSZLÓ FUCHS, AND SAHARON SHELAH Abstract. We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns
More informationProofs, Denotational Semantics and Observational Equivalences in Multiplicative Linear Logic
Under consideration for publication in Math. Struct. in Comp. Science Proofs, Denotational Semantics and Observational Equivalences in Multiplicative Linear Logic M I C H E L E P A G A N I Dipartimento
More informationDisplacement Logic for Grammar
Displacement Logic for Grammar Glyn Morrill & Oriol Valentín Department of Computer Science Universitat Politècnica de Catalunya morrill@cs.upc.edu & oriol.valentin@gmail.com ESSLLI 2016 Bozen-Bolzano
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationRESIDUATED FRAMES WITH APPLICATIONS TO DECIDABILITY
RESIDUATED FRAMES WITH APPLICATIONS TO DECIDABILITY NIKOLAOS GALATOS AND PETER JIPSEN Abstract. Residuated frames provide relational semantics for substructural logics and are a natural generalization
More informationHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically
More informationSome consequences of compactness in Lukasiewicz Predicate Logic
Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationAbstract In this paper, we introduce the logic of a control action S4F and the logic of a continuous control action S4C on the state space of a dynami
Modal Logics and Topological Semantics for Hybrid Systems Mathematical Sciences Institute Technical Report 97-05 S. N. Artemov, J. M. Davoren y and A. Nerode z Mathematical Sciences Institute Cornell University
More informationHow and when axioms can be transformed into good structural rules
How and when axioms can be transformed into good structural rules Kazushige Terui National Institute of Informatics, Tokyo Laboratoire d Informatique de Paris Nord (Joint work with Agata Ciabattoni and
More information