More fragments of language.
From MaRDI portal
Publication:867399
DOI10.1305/ndjfl/1153858644zbMath1116.03023MaRDI QIDQ867399
Ian Pratt-Hartmann, Allan Third
Publication date: 15 February 2007
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1153858644
03B65: Logic of natural languages
03D35: Undecidability and degrees of sets of sentences
03B35: Mechanization of proofs and logical operations
03D15: Complexity of computation (including implicit computational complexity)
Related Items
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics, Designing efficient controlled languages for ontologies, Tractability and intractability of controlled languages for data access, Equivalential structures for binary and ternary syllogistics, A system of relational syllogistic incorporating full Boolean reasoning, Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents