Compositionality, computability, and complexity

DOI10.1017/S1755020320000027MaRDI QIDQ5024502zbMATH OpenOpenAlexFDO

Authors Peter Pagin

Publication date 26 January 2022

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1755020320000027

zbMATH Keywords

semantic complexitysemantic compositionalityrecursive semanticscognitive difficultycomputable semantics

Mathematics Subject Classification ID

Logic of natural languages (03B65) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• From compositional to systematic semantics
• Natural language semantics and computability
• Formal features of compositionality
• scientific article; zbMATH DE number 4208062
• Aspects of compositionality

Cites work

• scientific article; zbMATH DE number 1805574 (Why is no real title available?)
• scientific article; zbMATH DE number 48095 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1794706 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• Assertion, inference, and consequence
• Communication and strong compositionality
• Compositionality and model-theoretic interpretation
• Formal features of compositionality
• General Terms and Relational Modality*
• On Constructor Rewrite Systems and the Lambda-Calculus
• On the Computational Complexity of Algorithms
• On the compositional extension problem
• Relational modality
• Term Rewriting and All That
• The weak lambda calculus as a reasonable machine

Cited in

(17)

• scientific article; zbMATH DE number 431759 (Why is no real title available?)
• scientific article; zbMATH DE number 1689582 (Why is no real title available?)
• Communication and strong compositionality
• Complexity, decidability and completeness
• Computation on structures. Behavioural theory, logic, complexity
• scientific article; zbMATH DE number 1870510 (Why is no real title available?)
• Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
• Compositionality and model-theoretic interpretation
• Complexity of terms, composition, and hypersubstitution
• Computability, complexity, logic. Transl. from the German
• Grammaticality and meaning shift
• On the nature of reverse compositionality
• scientific article; zbMATH DE number 4081545 (Why is no real title available?)
• Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
• Logical Aspects of Computational Linguistics
• From compositional to systematic semantics
• Questions about compositionality

This page was built for publication: Compositionality, computability, and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024502)