The No-Meaning Falsity: The Structural Impossibility of the Arbitrary Sign in Classical Arabic

• URL: http://arxiv.org/abs/2608.07737v1
• Date: Fri, 07 Aug 2026 20:01:20 GMT
• Title: The No-Meaning Falsity: The Structural Impossibility of the Arbitrary Sign in Classical Arabic
• Abstract summary: We investigate whether the claim of unrestricted semantic indeterminacy is compatible with the structural architecture of Classical Arabic.<n>We develop a formal mathematical model of Arabic non concatenative morphology in which lexical meaning is determined by the interaction between an invariant root and a morphosyntactic pattern.<n>We prove that general relative arbitrariness is formally undecidable, while Arabic relative arbitrariness is decidable and provably less than 1 for its motivated signifiers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates whether the postmodern claim of unrestricted semantic indeterminacy, and its foundational Saussurean axiom of the arbitrary sign, are compatible with the structural architecture of Classical Arabic. We develop a formal mathematical model of Arabic non concatenative morphology in which lexical meaning is determined by the interaction between an invariant root and a morphosyntactic pattern. Within this framework, we establish a Morphological Correspondence Theorem, demonstrating that every lexical item is uniquely generated by a root pattern pair, and a Semantic Localization Theorem, proving that lexical meaning is determined at the derivational level prior to surface realization. To address Saussurean weaker notion of relative arbitrariness, we formalize it via conditional Kolmogorov complexity, defining arbitrariness algorithmically as the no rule property. We prove that general relative arbitrariness is formally undecidable, while Arabic relative arbitrariness is decidable and provably less than 1 for its motivated signifiers (Levels W and M), establishing a strict system complexity asymmetry over Indo-European languages.

Related papers

• Lexically conditioned realization ambiguity in Korean predicate morphology [8.765495155656202]
  It asks whether a sequence of canonical morphemes and grammatical category labels uniquely determines the corresponding surface form.<n>The answer is negative for a restricted but theoretically revealing class of Korean predicates.<n>We analyze this phenomenon as homonymy with inflectional divergence.
  arXiv  Detail & Related papers  (2026-08-28T06:21:24Z)
• Rethinking and formalising the state across languages: a unified computational learning theory account [0.0]
  Article argues that the state is a context-dependent morphosyntactic mechanism that selects grammatical templates across synthetic languages.<n>A learning algorithm based on finite-set operations acquires and predicts state-dependent grammatical configurations.
  arXiv  Detail & Related papers  (2026-08-01T08:34:22Z)
• Surprisal Theory is Tautological (without Rational Grounding) [60.917028769172795]
  Surprisal theory holds that the human processing difficulty of a linguistic unit in context is an affine function of its surprisal under some language model.<n>I argue this claim is a tautology without further constraint.<n>I conclude that breaking the tautology requires a rationalist intervention.
  arXiv  Detail & Related papers  (2026-07-23T17:54:37Z)
• An Algebraic View of the Expressivity of Recurrent Language Models [50.88598486616582]
  The paper develops a unified algebraic account of the expressivity of recurrent neural networks.<n>The same architecture cannot implement an even-modulus counter once floating-point recurrences are enforced, yet realizes every even-modulus counter under unsigned-integer quantization.
  arXiv  Detail & Related papers  (2026-06-01T06:47:58Z)
• From Liar Paradox to Incongruent Sets: A Normal Form for Self-Reference [0.0]
  We study the role of incongruence as a structural source of semantic informativeness.<n>We show that semantic completeness precludes informativeness, while incongruence preserves it.<n>Incongruence manifests structurally as locally realizable but globally incompatible semantic commitments.
  arXiv  Detail & Related papers  (2026-03-25T17:04:42Z)
• A quantum semantic framework for natural language processing [0.0]
  We argue that semantic degeneracy imposes fundamental limitations on modern NLP systems, because they operate within natural language itself.<n>We show that as an expression's complexity grows, the amount of contextual information required to reliably resolve its ambiguity explodesly.<n>We argue that meaning is dynamically actualized through an observer-dependent interpretive act, a process whose non-deterministic nature is most appropriately described by a non-classical, quantum-like logic.
  arXiv  Detail & Related papers  (2025-06-11T18:00:30Z)
• A Complexity-Based Theory of Compositionality [53.025566128892066]
  In AI, compositional representations can enable a powerful form of out-of-distribution generalization.<n>Here, we propose a definition, which we call representational compositionality, that accounts for and extends our intuitions about compositionality.<n>We show how it unifies disparate intuitions from across the literature in both AI and cognitive science.
  arXiv  Detail & Related papers  (2024-10-18T18:37:27Z)
• Three Dogmas, a Puzzle and its Solution [0.0]
  In this paper we show that those assumptions contradict basic principles of Arabic. The Logicians ideas, that within Natural Language words refer to objects, 'ToBe'-constructions represent identity statements. Indefinite Descriptions must be replaced by existential quantifiers to form meaningful Sentences and Symbols can have no interpretation-independent meanings.
  arXiv  Detail & Related papers  (2023-10-29T19:20:38Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• Lexinvariant Language Models [84.2829117441298]
  Token embeddings, a mapping from discrete lexical symbols to continuous vectors, are at the heart of any language model (LM) We study textitlexinvariantlanguage models that are invariant to lexical symbols and therefore do not need fixed token embeddings in practice. We show that a lexinvariant LM can attain perplexity comparable to that of a standard language model, given a sufficiently long context.
  arXiv  Detail & Related papers  (2023-05-24T19:10:46Z)
• Constructing a Family Tree of Ten Indo-European Languages with Delexicalized Cross-linguistic Transfer Patterns [57.86480614673034]
  We formalize the delexicalized transfer as interpretable tree-to-string and tree-to-tree patterns. This allows us to quantitatively probe cross-linguistic transfer and extend inquiries of Second Language Acquisition.
  arXiv  Detail & Related papers  (2020-07-17T15:56:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.