Combinators for Paraconsistent Attitudes

12 years 4 months ago
Combinators for Paraconsistent Attitudes
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).
Jørgen Villadsen
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where LACL
Authors Jørgen Villadsen
Comments (0)