Publication:4331781

zbMath0874.03001MaRDI QIDQ4331781

No author found.

Publication date: 5 February 1997

zbMATH Keywords

generics; types; dynamics; compositionality; proof theory; Montague grammar; defaults; generalized quantifiers; nonmonotonicity; game-theoretical semantics; partiality; plurals; questions; collectivity; formal learning theory; mathematical linguistics; feature logics; situation theory; temporality; categorial type logics; semantics of natural languages; application of logic to linguistics; GB theory; presuppostion; representing discourse in context

Mathematics Subject Classification ID

03B65: Logic of natural languages

68T50: Natural language processing

03-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations

Related Items

Galois Connections in Categorial Type Logic, The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable, Learnability of type-logical grammars, k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures, On the finite embeddability property for residuated ordered groupoids, Displacement logic for anaphora, Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages, Tarski, truth and natural languages, What languages have Tarski truth definitions?, On families of categorial grammars of bounded value, their learnability and related complexity questions, The logic and meaning of plurals. I, Question answering and database querying: bridging the gap with generalized quantification, Logic and reasoning: do the facts matter?, A modular and parameterized presentation of pregroup calculus, Algebraic translations, correctness and algebraic compiler construction, Propositional logic of imperfect information: Foundations and applications, Ordering constraints over feature trees expressed in second-order monadic logic., Partial algebras, meaning categories and algebraization, \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures, Type logics and pregroups, Learnability of pregroup grammars, Modeling the concept of majority opinion in group decision making, Lambek calculus is NP-complete, On the computational consequences of independence in propositional logic, Sequent Calculi for ‘Generally’, Game Semantics and the Manifestation Thesis, Negative Polar Interrogatives and Bias