Abstract
We pursue the program of exposing the intrinsic mathematical structure of the “space of a proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linear Logic (MALL). We use tools from Domain theory to develop a semantic notion of proof net for MALL, and prove a Sequentialization Theorem. We also give an interactive criterion for strategies, formalized in the same Domain-theoretic setting, to come from proofs, and show that a “semantic proof structure” satisfies the geometric correctness criterion for proof-nets if and only if it satisfies the interactive criterion for strategies. We also use the Domain-theoretic setting to give an elegant compositional account of Cut-Elimination. This work is a continuation of previous joint work with Radha Jagadeesan [AJ94b] and Paul-André Melliès [AM99].
This research was partly supported by EPSRC Grant EP/D038987/1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abramsky, S., Jagadeesan, R.: New foundations for the geometry of interaction. Information and Computation 111(1), 53–119 (1994)
Abramsky, S., Jagadeesan, R.: Games and Full Completeness for Multiplicative Linear Logic. Journal of Symbolic Logic 59(2), 543–574 (1994)
Abramsky, S., Melliés, P.-A.: Concurrent games and full completeness. In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, pp. 431–444. IEEE Computer Society Press, Los Alamitos (1999)
Abramsky, S.: Event Domains, Stable Functions and Proof-Nets. Electronic Notes in Theoretical Computer Science 172, 33–67 (2007)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50, 1–102 (1987)
Girard, J.-Y.: Multiplicatives. Rendiconti del Seminario Matematico (Torino), Universita Pol. Torino (1988)
Girard, J.-Y.: Geometry of Interaction I: Interpretation of System F. In: Ferro, R., et al. (eds.) Logic Colloquium 1988, pp. 221–260. North-Holland, Amsterdam (1989)
Girard, J.-Y.: Proof-nets: the parallel syntax for proof theory. In: Logic and Algebra, Marcel Dekker (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abramsky, S. (2007). Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-74915-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74914-1
Online ISBN: 978-3-540-74915-8
eBook Packages: Computer ScienceComputer Science (R0)