Munich Personal RePEc Archive
metadata only
A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"
This note examines the complexity of complete transitive binary relations or tournaments using Kolmogorov complexity. The complexity of tournaments calculated using Kolmogorov complexity is then compared to minimally complex tournaments defined in terms of the minimal number of examples needed to de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"#1276400
- The Proverbial Strategy. Free Relatives and Logical Relations#75769
- Relational and Distributive Discrimination#72913
- One-to-many-relations in morphology, syntax, and semantics (Volume 7)#296692
- When Contrast Becomes Fact: Commitment and the Relational Ontology of Event Density#714004
Record · ID 1276604
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive