Phase semantics and decidability of elementary affine logic

Authors:
Ugo Dal Lago;Simone Martini
Affiliations:
Dipartimento di Scienze dell'Informazione, Università di Bologna, Mura Anteo Zamboni, 7, Bologna BO 40127, Italy;Dipartimento di Scienze dell'Informazione, Università di Bologna, Mura Anteo Zamboni, 7, Bologna BO 40127, Italy
Venue:
Theoretical Computer Science - Logic, semantics and theory of programming
Year:
2004

Citing 16
Cited 1

Linear logic

Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability

Theoretical Computer Science
Light linear logic

Information and Computation
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic

Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages

The optimal implementation of functional programming languages
(Optimal) duplication is not elementary recursive

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intuitionistic Light Affine Logic

ACM Transactions on Computational Logic (TOCL)
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Checking Polynomial Time Complexity with Types

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Phase semantics for light linear logic

Theoretical Computer Science - Linear logic
Decidability of Linear Affine Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear logic and elementary time

Information and Computation - Special issue: ICC '99
Soft linear logic and polynomial time

Theoretical Computer Science - Implicit computational complexity
Typing lambda terms in elementary logic with linear constraints

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Principal typing in elementary affine logic

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications

A semantic proof of polytime soundness of light affine logic

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Light, elementary and soft linear logics are formal systems derived from Linear Logic, enjoying remarkable normalization properties. In this paper, we prove decidability of Elementary Affine Logic, EAL. The result is obtained by semantical means, first defining a class of phase models for EAL and then proving soundness and (strong) completeness, following Okada's technique. Phase models for Light Affine Logic and Soft Linear Logic are also defined and shown complete.