COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY

DOI10.1017/S1755020320000027OpenAlexW3038222898MaRDI QIDQ5024502

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)

Related Items

Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs

Cites Work

• Assertion, inference, and consequence
• On the compositional extension problem
• The weak lambda calculus as a reasonable machine
• Relational modality
• Communication and strong compositionality
• Formal features of compositionality
• Compositionality and model-theoretic interpretation
• On Constructor Rewrite Systems and the Lambda-Calculus
• Term Rewriting and All That
• General Terms and Relational Modality*
• On the Computational Complexity of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item