Private Names in Non-Commutative Logic

Authors Ross Horne, Alwen Tiu, Bogdan Aman, Gabriel Ciobanu

Thumbnail PDF


  • Filesize: 0.56 MB
  • 16 pages

Document Identifiers

Author Details

Ross Horne
Alwen Tiu
Bogdan Aman
Gabriel Ciobanu

Cite AsGet BibTex

Ross Horne, Alwen Tiu, Bogdan Aman, and Gabriel Ciobanu. Private Names in Non-Commutative Logic. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


We present an expressive but decidable first-order system (named MAV1) defined by using the calculus of structures, a generalisation of the sequent calculus. In addition to first-order universal and existential quantifiers the system incorporates a de Morgan dual pair of nominal quantifiers called `new' and `wen', distinct from the self-dual Gabbay-Pitts and Miller-Tiu nominal quantifiers. The novelty of the operators `new' and `wen' is they are polarised in the sense that `new' distributes over positive operators while `wen' distributes over negative operators. This greater control of bookkeeping enables private names to be modelled in processes embedded as predicates in MAV1. Modelling processes as predicates in MAV1 has the advantage that linear implication defines a precongruence over processes that fully respects causality and branching. The transitivity of this precongruence is established by novel techniques for handling first-order quantifiers in the cut elimination proof.
  • process calculi
  • calculus of structures
  • nominal logic
  • causal consistency


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Luca Aceto and Matthew Hennessy. Adding action refinement to a finite process algebra. Information and Computation, 115(2):179-247, 1994. URL:
  2. Andrei Alexandru and Gabriel Ciobanu. Nominal techniques for π I-calculus. Romanian Journal of Information Science and Technology, 16(4):261-286, 2013. Google Scholar
  3. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992. URL:
  4. Marek Bednarczyk. Hereditary history preserving bisimulations. Technical report, Polish Academy of Sciences, Gdańsk, 1991. Google Scholar
  5. Kai Brünnler. Deep inference and symmetry in classical proofs. PhD thesis, TU Dresden, 2003. Google Scholar
  6. Kai Brünnler. Locality for classical logic. Notre Dame J. Form. Log., 47(4):557-580, 2006. Google Scholar
  7. Paola Bruscoli. A purely logical account of sequentiality in proof search. In ICLP, volume 2401 of LNCS, pages 302-316. Springer, 2002. URL:
  8. Paola Bruscoli and Alessio Guglielmi. On the proof complexity of deep inference. ACM Transactions on Computational Logic (TOCL), 10(2), 2009. URL:
  9. Luís Caires and Frank Pfenning. Session types as intuitionistic linear propositions. In CONCUR 2010, pages 222-236. Springer, 2010. URL:
  10. Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger. The focused calculus of structures. In EACSL, volume 12, pages 159-173, 2011. URL:
  11. Gabriel Ciobanu and Ross Horne. Non-interleaving operational semantics for geographically replicated databases. In SYNASC 2013, pages 440-447, 2013. URL:
  12. Gabriel Ciobanu and Ross Horne. Behavioural analysis of sessions using the calculus of structures. In PSI 2015, 25-27 August, Kazan, Russia, volume 9609 of LNCS, 2015. Google Scholar
  13. Murdoch J. Gabbay. The π-calculus in FM. In Thirty Five Years of Automating Mathematics, pages 247-269. Springer, 2003. URL:
  14. Andrew Gacek, Dale Miller, and Gopalan Nadathur. Nominal abstraction. Information and Computation, 209(1):48-73, 2011. URL:
  15. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1-112, 1987. URL:
  16. Alessio Guglielmi. Re:encoding pi calculus in calculus of structures. post on public mailing list, 2004.
  17. Alessio Guglielmi. A system of interaction and structure. ACM Transactions on Computational Logic, 8(1), 2007. URL:
  18. Alessio Guglielmi and Lutz Straßburger. A system of interaction and structure V: The exponentials and splitting. Math. Struct. Comp. Sci., 21(03):563-584, 2011. URL:
  19. Kohei Honda et al. Scribbling interactions with a formal foundation. In ICDCIT 2011, volume 6536 of LNCS, pages 55-75. Springer, 2011. URL:
  20. Ross Horne. The consistency and complexity of multiplicative additive system virtual. Sci. Ann. Comp. Sci., 25(2):245-316, 2015. URL:
  21. Naoki Kobayashi and Akinori Yonezawa. ACL - a concurrent linear logic programming paradigm. In ILPS'93, pages 279-294. MIT Press, 1993. Google Scholar
  22. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978. URL:
  23. Patrick Lincoln and Natarajan Shankar. Proof search in first-order linear logic and other cut-free sequent calculi. In LICS'94, pages 282-291. IEEE, 1994. URL:
  24. José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992. URL:
  25. Dale Miller and Alwen Tiu. A proof theory for generic judgements. ACM Transactions on Computational Logic (TOCL), 6(4):749-783, 2005. URL:
  26. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1-77, 1992. URL:
  27. Peter O'Hearn and David Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999. URL:
  28. Andrew Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186(2), 2003. URL:
  29. Vaughan Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33-71, 1986. URL:
  30. Christian Retoré. Pomset logic: A non-commutative extension of classical linear logic. In TLCA'97, volume 1210 of LNCS, pages 300-318. Springer, 1997. URL:
  31. Luca Roversi. A deep inference system with a self-dual binder which is complete for linear lambda calculus. J. of Log. and Comp., 26(2):677-698, 2016. URL:
  32. Davide Sangiorgi. π-calculus, internal mobility, and agent-passing calculi. Theoretical Computer Science, 167(1):235-274, 1996. URL:
  33. Vladimiro Sassone, Mogens Nielsen, and Glynn Winskel. Models for concurrency: towards a classification. Th. Comp. Sci., 170(1-2):297-348, 1996. URL:
  34. Lutz Straßburger. Linear logic and noncommutativity in the calculus of structures. PhD thesis, TU Dresden, 2003. Google Scholar
  35. Lutz Straßburger. Some observations on the proof theory of second order propositional multiplicative linear logic. In TLCA 2009, volume 5608 of LNCS, pages 309-324. Springer, 2009. URL:
  36. Lutz Straßburger and Alessio Guglielmi. A system of interaction and structure IV: the exponentials and decomposition. TOCL, 12(4):23, 2011. URL:
  37. Alwen Tiu. A system of interaction and structure II: The need for deep inference. Logical Methods in Computer Science, 2(2:4):1-24, 2006. URL:
  38. Alwen Tiu and Dale Miller. Proof search specifications of bisimulation and modal logics for the π-calculus. TOCL, 11(2):13, 2010. URL:
  39. Rob van Glabbeek. The linear time-branching time spectrum (extended abstract). In CONCUR '90, volume 458 of LNCS, pages 278-297. Springer, 1990. URL:
  40. Rob van Glabbeek. Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP. In Correct System Design, volume 9360 of LNCS, pages 99-130. Springer, 2015. URL:
  41. Rob van Glabbeek and Ursula Goltz. Refinement of actions and equivalence notions for concurrent systems. Acta Informatica, 37(4-5):229-327, 2001. URL:
  42. Philip Wadler. Propositions as sessions. J. of Fun. Prog., 24(2-3):384-418, 2014. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail