Efficient communication and indexicality
From MaRDI portal
Publication:2019332
DOI10.1016/j.mathsocsci.2020.06.002zbMath1505.91110OpenAlexW3035490120MaRDI QIDQ2019332
Publication date: 26 April 2021
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://philarchive.org/rec/SUZSL-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- A learning-efficiency explanation of structure in language
- Finite automata play the repeated prisoner's dilemma
- We can't disagree forever
- Agreeing to disagree
- On the representation of context
- Communication, consensus, and knowledge
- Language and the Theory of the Firm
- Directives, expressives, and motivation
- Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?
- Debates and decisions: On a rationale of argumentation rules.
This page was built for publication: Efficient communication and indexicality