Abstract
We present in this article a new logical system inspired from linear logic. This system is designed in order to express causality and dynamism. The cut elimination theorem holds for this logic. Examples of applications are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramsky, S., ‘Computational interpretations of linear logic’, Theoretical Computer Science 111, 3–57, 1993.
Bellot, P., J.-P. Cottin, A. Demaille, J. Leneutre, E. Zarpas, ‘A logic of actions for imperative program synthesis’, European Summer Meeting of the Association for the Symbolic Logic (Logic Colloquium'96), San Sebastian, 1996 (to appear).
Bellot, P., J. Leneutre, E. Zarpas, ‘The B-logic, from the big bang to the big crunch’, TELECOM Paris internal report n. 94C002, 1994.
Bellot, P., J. Leneutre, B. Robinet, E. Zarpas, ‘Future trends of software engineering’, TELECOM Paris internal report n. 94D020, 1994.
Bellot, P., R. Legrand, ‘From logic to relational calculus’, ILPS'93, Global Compilation workshop, S. Michaylov & W. Winsborough (ed.), Vancouver (Canada), October 1993.
de Bruijn, N., ‘A survey of the project Automath’, in To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, p. 579–606, Academic Press, 1980.
Coquand, T., G. Huet, ‘Concepts mathématiques et informatiques formalisés dans le lambda-calcul des constructions’, in Logic Colloquiurn'85, North-Holland, Amsterdam, 1985.
Curry, H. B., R. Feys, Combinatory Logic, vol. I, North-Holland, Amsterdam, 1958.
Girard, J-Y., ‘Linear Logic’, Theoretical Computer Science 50, 1–102, 1987.
Girard, J-Y., ‘Introduction à la Logique Linéaire’, in Logique et informatique: une introduction, INRIA, B. Courcelle (ed.), Paris, 1989.
Girard, J-Y., ‘Towards a geometry of interaction’, Contemporary Mathematics 92, 69–108, 1989.
Huet, G., et al., The Coq proof assistant users's guide, version 5.6, INRIA Report 134, Paris, 1990.
Krivine, J-L., Lambda-Calcul, Types et Modèles, Masson, collection E.R.I, 1990.
Krivine, J-L., M. Parigot, ‘Programming with proofs’, in 6th Symposium on Computation Theory, Wendish-Rietz, 1987.
Martin-LÖf, P., ‘Constructive mathematics and computer programming’, in Logic, Methodology and the Philosophy of Sciences 6, p. 153–175, North-Holland, Amsterdam, 1980.
Masseron, M., C. Tollu, J. Vauzeilles, ‘Generating plans in Linear Logic: Actions as proofs’, Theoretical Computer Science 113, 349–370, 1993.
Reddy, U. S., ‘A linear logic model of state’, University of Illinois at Urbana-Champaign, manuscript available by ftp from s.uiuc.edu, directory /pub/reddy/papers, 1993.
RetorÉ, C., Réseaux et Séquents Ordonnés, Phd thesis, University of Paris 7, Paris, February 1993.
Rights and permissions
About this article
Cite this article
Bellot, P., Cottin, JP., Robinet, B. et al. Prolegomena of a Logic of Causality and Dynamism. Studia Logica 62, 77–105 (1999). https://doi.org/10.1023/A:1005124501371
Issue Date:
DOI: https://doi.org/10.1023/A:1005124501371