Abstract
In this paper, we propose new labelled proof systems to analyse the intuitionistic provability in classical and linear logics. An important point is to understand how search in a non-classical logic can be viewed as a perturbation of search in classical logic. Therefore, suitable characterizations of intuitionistic provability and related labelled sequent calculi are defined for linear logic. An alternative approach, based on the notion of proof-net and on the definition of suitable labelled classical proof-nets, allows to directly study the intuitionistic provability by constructing intuitionistic proof-nets for sequents of classical linear logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Computational interpretations of Linear Logic.Theoretical Computer Science,111(1–2):3–58, 1993.
V. Alexiev. Applications of Linear Logic to Computation: An Overview.Bulletin of the IGPL, 2(1):77–107, 1994.
A. Asperti. Causal dependencies in multiplicative linear logic with MIX.Math. Struct. in Comp. Science, 5:351–380, 1995.
G. Bellin. Subnets of proof-nets in multiplicative linear logic with MIX.Math. Struct. in Comp. Science, 7:663–699, 1997.
G. Bellin and J. van de Wiele. Subnets of proof-nets in MLL. In J.Y. Girard, Y. Lafont, and L. Regnier, editorsAdvances in Linear Logic, pages 249–260. Cambridge University Press, 1995.
N. Benton, G. Bierman, V. de Paiva, and M. Hyland. A term calculus for intuitionistic linear logic. InInt. Conference on Typed Lambda Calculi and Applications LNCS 664,pages 75–90, Utrecht, The Netherlands, March 1993.
G.M. Bierman. A note on Full Intuitionistic Linear Logic.Annals of Pure and Applied Logic, 79:281–287, 1996.
G.M. Bierman. Towards a classical linear A-calculus (preliminary report).Electronic Notes in Theoretical Computer Science, 3, 1996.
E. Boudinet and D. Galmiche. Proofs, concurrent objects and computations in a FILL framework. InWorkshop on Object-based Parallel and Distributed Computation OBPDC’95 LNCS 1107, pages 148–167, Tokyo, Japan, 1996.
T. Brauner and V. de Paiva. Cut elimination for Full Intuitionistic Linear Logic. Unpublished draft, 1996.
M. D’Agostino and D.M. Gabbay A Generalization of Analytic Deduction via Labelled Deductive Systems. Part I: Basic substructural logics.Journal of Automated Reasoning, 13:243–281, 1994.
V. Danos and L. Regnier. The structures of multiplicatives.Arch. Math. Logic, 28:181–203, 1989.
R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic.Journal of Symbolic Logic, 57:795–807, 1992.
U. Engberg and G. Winskel. Completeness results for linear logic on Petri nets.Annals of Pure and Applied Logic, 86:101–135, 1997.
D. Galmiche. Connection methods in Linear Logic and Proof nets Construction.Theoretical Computer Science, 1999. Accepted for publication.
D. Galmiche and D. Larchey-Wendling. Provability in intuitionistic linear logic from a new interpretation on Petri nets - extended abstract.Electronic Notes in Theoretical Computer Science, 17, 1998.
D. Galmiche and B. Martin. Proof search and proof nets construction in linear logic. In4th Workshop on Logic Language Information and Computation Wollic’97, Fortaleza, Brasil, August 1997. Logic Journal of IGPL, vol. 5–6, pp 883–885.
D. Galmiche and B. Martin. Proof nets construction and automated deduction in non-commutative linear logic - extended abstract.Electronic Notes in Theoretical Computer Science, 17, 1998.
D. Galmiche and G. Perrier.A procedure for automatic proof nets construction. In International Conference on Logic Programming and Automated Reasoning LNAI 624, pages 42–53, St. Petersburg, Russia, July 1992.
J.Y. Girard. Linear logic and parallelism. InMathematical Models for the Semantics of Parallelism LNCS 280,pages 166–182, Roma, Italia, October 1986.
J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1–102, 1987.
J.Y. Girard. Linear logic: its syntax and semantics. In J.Y. Girard, Y. La-font, and L. Regnier, editorsAdvances in Linear Logic, pages 1–42. Cambridge University Press, 1995.
J.Y. Girard. Proof nets: the parallel syntax for proof theory. In Ursini and Agliano, editorsLogic and Algebra, New York, 1995. M. Dekker.
J.Y. Girard and Y. Lafont. Linear logic and lazy computation. InTAPSOFT 87 LNCS 250,pages 52–66, Pisa, Italia, March 1987.
J. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic.Journal of Information and Computation, 110:327–365, 1994.
M. Hyland and V. de Paiva. Full Intuitionistic Linear Logic (extended abstract).Annals of Pure and Applied Logic, 64:273–291, 1993.
P. Lincoln and J. Mitchell. Operational aspects of linear lambda calculus. In7th IEEE Symposium on Logic in Computer Science, pages 235–246, Santa-Cruz, California, 1992.
D. Miller. Forum: A multiple-conclusion specification logic.Theoretical Computer Science, 165(1):201–232, 1996.
M. Parigot. Aft-calculus: an algorithmic interpretation of classical natural deduction. InInternational Conference on Logic Programming and Automated Reasoning LNAI 624, pages 190–201, St. Petersburg, Russia, July 1992.
E. Ritter, D. Pym, and L. Wallen. On the intuitionistic force of classical search. In5th Int. Workshop TABLEAUX’96 LNAI 1071, pages 294–313, Terrasini, Palermo, Italy, May 1996.
H. Schellinx Some syntactical observations on linear logic.Journal of Logic and Computation 1(4):537–559 1991.
L.A. Wallen. Automated Proof search in Non-Classical Logics.MIT Press, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Balat, V., Galmiche, D. (2000). Labelled Proof Systems for Intuitionistic Provability. In: Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds) Labelled Deduction. Applied Logic Series, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4040-9_1
Download citation
DOI: https://doi.org/10.1007/978-94-011-4040-9_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5781-3
Online ISBN: 978-94-011-4040-9
eBook Packages: Springer Book Archive