Abstract
In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences cover a fragment of English with propositional attitudes like knowledge, belief and assertion. A combinator is a closed term of the lambda calculus possibly containing lexical and/or logical constants. Such combinators seem promising from both a cognitive and computational point of view. There is approximately one lexical combinator for each word, but just eleven logical combinators for the present fragment. The partiality is only used for embedded sentences expressing propositional attitudes, thereby allowing for inconsistency without explosion (also called paraconsistency), and is based on a few key equalities for the connectives giving four truth values (truth, falsehood, and undefinedness with negative and positive polarity; only the first truth value is designated, i.e. yields the logical truths).
This is a preview of subscription content, log in via an institution to check access.
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
A.R. Anderson and N. D. Belnap Jr. Entailment: The Logic of Relevance and Necessity. Princeton University Press, 1975.
P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Academic Press, 1986.
O. Arieli and A. Avron. Bilattices and paraconsistency. In Frontiers in Paraconsistent Logic, pages 11–28. Research Studies Press, 2000.
R. Audi, editor. The Cambridge Dictionary of Philosophy. Cambridge University Press, 1995.
H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, revised edition, 1984.
J. Barwise and J. Perry. Situations and Attitudes. MIT Press, 1983.
N. D. Belnap Jr. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, pages 8–37. D. Reidel, 1977.
B. Carpenter. Type-Logical Semantics. MIT Press, 1997.
G. Chierchia and S. McConnell-Ginet. Meaning and Grammar: An Introduction to Semantics. MIT Press, 2nd edition, 2000.
M. J. Cresswell. Entities and Indices. Kluwer Academic Publishers, 1990.
P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986.
H. B. Curry, R. Feys, and W. Craig. Combinatory Logic I. North-Holland, 1958.
H. B. Curry, J. R. Hindley, and J. P. Seldin. Combinatory Logic II. North-Holland, 1972.
J. Dölling. Ontological domains, semantic sorts and systematic ambiguity. International Journal of Human-Computer Studies, 43:785–807, 1995.
M. Fitting. Bilattices and the theory of truth. Journal of Philosophical Logic, 18:225–256, 1989.
M. Ginsberg. Multivalued logics: A uniform approach to inference in artificial intelligence. Computer Intelligence, 4:265–316, 1988.
R. Montague. The proper treatment of quantification in ordinary English. In Approaches to Natural Language, pages 221–242. D. Reidel, 1973.
M. Moortgat. Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus. Foris Publications, 1988.
G. Morrill. Type Logical Grammar. Kluwer Academic Publishers, 1994.
R. Muskens. Anaphora and the logic of change. In Logics in AI: European Workshop JELIA, pages 412–427. Springer, LNCS 478, 1991.
R. Muskens. Meaning and Partiality. CSLI Publications, 1995.
R. Muskens. On partiality and paraconsistent logics. Notre Dame Journal of Formal Logic. To appear.
L. C. Paulson. Isabelle: A Generic Theorem Prover. Springer, LNCS 828, 1994.
W. C. Purdy. A logic for natural language. Notre Dame Journal of Formal Logic, 32:409–425, 1991.
W. C. Purdy. Surface reasoning. Notre Dame Journal of Formal Logic, 33:13–36, 1992.
V. Sánchez. Studies on Natural Logic and Categorial Grammar. PhD thesis, University of Amsterdam, 1991.
P. Simons. Combinators and categorial grammar. Notre Dame Journal of Formal Logic, 30:242–261, 1989.
M. Steedman. Combinators and grammars. In Categorial Grammars and Natural Language Structures, pages 417–442. D. Reidel, 1988.
E. Thijsse. Partial Logic and Knowledge Representation. PhD thesis, Tilburg University, 1992.
J. van Benthem. Language in Action: Categories, Lambdas and Dynamic Logic. North-Holland, 1991.
J. Villadsen. Combinatory categorial grammar for intensional fragment of natural language. In Scandinavian Conference on Artificial Intelligence, pages 328–339. IOS Press, 1991.
J. Villadsen. Anaphora and intensionality in classical logic. In Nordic Computational Linguistics Conference, pages 165–175. Norwegian Computing Centre for the Humanities, 1992.
J. Villadsen. Information states as first class citizens. In Annual Meeting of the Association for Computational Linguistics, pages 303–305. 1992.
J. Villadsen. Nabla: A Linguistic System based on Multi-dimensional Type Theory. PhD thesis, Technical University of Denmark, 1995.
J. Villadsen. Using lexical and logical combinators in natural language semantics. Consciousness Research Abstracts, pages 51–52, 1997.
J. Villadsen. Meaning and partiality revised. In Scandinavian Conference on Artificial Intelligence, pages 163–164. IOS Press, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villadsen, J. (2001). Combinators for Paraconsistent Attitudes. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-48199-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42273-0
Online ISBN: 978-3-540-48199-7
eBook Packages: Springer Book Archive