Lambek-Calculus with general elimination rules and continuation semantics

Authors:
Nissim Francez
Affiliations:
Computer Science dept., Technion-IIT, Haifa, Israel
Venue:
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Year:
2005

Citing 3
Cited 0

The syntactic process

The syntactic process
Natural Deduction for Intuitionistic Non-communicative Linear Logic

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A judgmental reconstruction of modal logic

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In modern approaches to proof-theory (e.g.,[8]) natural-deduction (ND) proof systems are presented with general elimination-rules (GE-rules) [10], derived from a more general (re)formulation of Prawitz's inversion principle [13]. The setting of such enterprises are usually intuitionistic (and occasionally classic), but also linear [7] propositional calculi.