On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication

DOI10.1007/978-3-642-04027-6_16zbMath1257.03070OpenAlexW1835137587MaRDI QIDQ3644749

Luigi Santocanale, J. Robin B. Cockett

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_16

zbMATH Keywords

word problemproof theorygame semanticstwo-way communication\(\Sigma \Pi \)-categoriesbicartesian categories

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50) Word problems, etc. in computability and recursion theory (03D40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of message-passing
• A game semantics for linear logic
• Coherence completions of categories
• Bicartesian Coherence Revisited
• Games and full completeness for multiplicative linear logic
• Deductive systems and categories
• Free \(\mu\)-lattices

Related Items (2)

Unnamed Item ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem

This page was built for publication: On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication