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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barker, C.: Continuation and the nature of quantification. Natural Language Semantics 10, 211–242 (2002)
Barker, C.: Continuation in natural language. In: Thielecke, H. (ed.) Proceedings of the Fourth ACM SIGPLAN Continuations Workshop, CW 2004 (2004)
de Groote, P.: Type raising, continuations, and classical logic. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the thirteenth Amsterdam Colloquium, pp. 97–101. ILLC, Amsterdam (2001)
Joachimski, F., Matthes, R.: Short proofs of normalization for a lambda calculus, permutative conversions and Gödel’s T. Archives for Mathematical Logic 42(1), 59–87 (2003)
Lambek, J.: The mathematics of sentence structure. Amer. Math. monthly 65, 154–170 (1958)
Moortgat, M.: Categorial type logics. In: van Benthemand, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 93–178. North Holland, Amsterdam (1997)
Negri, S.: Varieties of linear calculi. J. of Phil. Logic 32(6), 569–590 (2002)
Negri, S., Von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)
Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science 11, 511–540 (2001)
Von Plato, J.: Natural deduction with general elimination rules. Archive Mathematical Logic 40, 541–567 (2001)
Plotkin, G.D.: Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1(2), 125–159 (1975)
Polakow, J., Pfenning, F.: Natural deduction for intuitionistic non-commutative linear logic. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 295–309. Springer, Heidelberg (1999)
Prawitz, D.: Natural Deduction: Proof-Theoretical Study. Almqvist and Wicksell, Stockholm (1965)
Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J. (ed.) Proc. 2nd Scandinavian Symposium, North-Holland, Amsterdam (1971)
Steedman, M.: The Syntactic Process. MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Francez, N. (2005). Lambek-Calculus with General Elimination Rules and Continuation Semantics. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_7
Download citation
DOI: https://doi.org/10.1007/11422532_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25783-7
Online ISBN: 978-3-540-31953-5
eBook Packages: Computer ScienceComputer Science (R0)