A formulation of linear logic based on dependency-relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 129-148

  Braüner, Torben ^a   De Paiva, Valeria ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; LINEAR ALGEBRA; RECONFIGURABLE HARDWARE;

CLASSICAL LINEAR LOGIC; CUT ELIMINATION; CUT-ELIMINATION THEOREM; DEPENDENCY RELATION; EXPONENTIALS; FORMAL SYSTEMS; LINEAR LOGIC; MULTIPLICATIVE LINEAR LOGIC;

COMPUTER CIRCUITS;

EID: 84906738697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028011     Document Type: Conference Paper

References (15)

1. T. Brauner and V. de Paiva. Cut-elimination for full intuitionistic linear logic. Technical Report 395, Computer Laboratory, University of Cambridge, 1996. 27 pages. Also available as Technical Report RS-96-10, BRICS, University of Aarhus.
2. G. Beilin. Subnets of proofnets in multiplicative linear logic with MIX. Manuscript, 1996.
3. G. Bierman. A note on full intuitionistic linear logic. Annals of Pure and Applied Logic, 79, 1996.
4. G. Bierman. A classical linear A-calculus. 1997. Submitted for publication.
5. J. R. B. Cockett and R. A. G. Seely. Proof theory for full intuitionistic linear logic, bilinear logic, and MIX categories. Manuscript, 1996.
6. V. C. V. de Paiva. The Dialectica Categories. PhD thesis, Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 1988. Published as Computer Laboratory Technical Report 213.
7. V. de Paiva and L. C. Pereira. A new proof system for intuitionistic logic. The Bulletin of Symbolic Logic, 1:101, 1995.
8. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.
9. J.-Y. Girard. Light linear logic. Manuscript, 1994.
10. J.-Y. Girard and Y. Lafont. Linear logic and lazy computation. In Proceedings of TAPSOFT’87, LNCS, volume 250. Springer-Verlag, 1987.
11. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
12. M. Hyland and V. de Paiva. Full intuitionistic linear logic (extended abstract). Annals of Pure and Applied Logic, 64, 1993.
13. M. Parigot. A^-calculus: An algorithmic interpretation of classical natural deduction. In Proceedings of LPAR, LNCS, volume 624. Springer-Verlag, 1992.
14. H. SchelJinx. Some syntactic observations on linear logic. Journal of Logic and Computation, 1, 1991.
15. M. Shirahata. Linear Set Theory. PhD thesis, Stanford University, 1994.