Fragments of language
From MaRDI portal
Publication:1827411
DOI10.1023/B:JLLI.0000024735.97006.5azbMath1046.03014OpenAlexW2011550070MaRDI QIDQ1827411
Publication date: 6 August 2004
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jlli.0000024735.97006.5a
Logic of natural languages (03B65) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
A `natural logic' inference system using the Lambek calculus ⋮ A simple logic of concepts ⋮ Applied logic without psychologism ⋮ Conditionals and consequences ⋮ A system of relational syllogistic incorporating full Boolean reasoning ⋮ Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents ⋮ Logics for Two Fragments beyond the Syllogistic Boundary ⋮ First order logic without equality on relativized semantics ⋮ LOGICS FOR THE RELATIONAL SYLLOGISTIC ⋮ Logic and Complexity in Cognitive Science
This page was built for publication: Fragments of language
