From light logics to type assignments: a case study

&
Logic Journal of the IGPL 17 (5):499-530 (2009)
  Copy   BIBTEX

Abstract

Using Soft Linear Logic as case study, we analyze a method for transforming a light logic into a type assignment system for the λ-calculus, inheriting the complexity properties of the logics. Namely the typing assures the strong normalization in a number of steps polynomial in the size of the term, and moreover all polynomial functions can be computed by λ-terms that can be typed in the system. The proposed method is general enough to be used also for other light logics

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzp019

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Comparing cubes of typed and type assignment systems.Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca & Pawel Urzyczyn - 1997 - Annals of Pure and Applied Logic 86 (3):267-303.
The philosophy of alternative logics.Andrew Aberdein & Stephen Read - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press. pp. 613-723.
On proof terms and embeddings of classical substructural logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
Public announcements, public assignments and the complexity of their logic.Hans van Ditmarsch, Andreas Herzig & Tiago De Lima - 2012 - Journal of Applied Non-Classical Logics 22 (3):249-273.
On the Beth properties of some intuitionistic modal logics.C. Luppi - 2002 - Archive for Mathematical Logic 41 (5):443-454.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
A first approach to abstract modal logics.Josep M. Font & Ventura Verdú - 1989 - Journal of Symbolic Logic 54 (3):1042-1062.
Predicate Modal Logics Do Not Mix Very Well.Olivier Gasquet - 1998 - Mathematical Logic Quarterly 44 (1):45-49.
A Fast Deterministic Algorithm For Formulas That Have Many Satisfying Assignments.E. Hirsch - 1998 - Logic Journal of the IGPL 6 (1):59-71.
A Closer Look at Some Subintuitionistic Logics.Ramon Jansana & Sergio Celani - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
A Closer Look at Some Subintuitionistic Logics.Sergio Celani & Ramon Jansana - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
Logics without the contraction rule and residuated lattices.Hiroakira Ono - 2011 - Australasian Journal of Logic 8:50-81.
Normal monomodal logics can simulate all others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
A universal logic approach to adaptive logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.

Analytics

Added to PP
2015-02-04

Downloads
2 (#1,800,073)

6 months
2 (#1,192,610)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references