From Liar Paradox to Incongruent Sets: A Normal Form for Self-Reference

• URL: http://arxiv.org/abs/2603.24527v1
• Date: Wed, 25 Mar 2026 17:04:42 GMT
• Title: From Liar Paradox to Incongruent Sets: A Normal Form for Self-Reference
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce incongruent normal form (INF), a structural representation for self-referential semantic sentences. An INF replaces a self-referential sentence with a finite family of non-self-referential sentences that are individually satisfiable but not jointly satisfiable. This transformation isolates the semantic obstruction created by self-reference while preserving classical semantics locally and is accompanied by correctness theorems characterizing when global inconsistency arises from locally compatible commitments. We then study the role of incongruence as a structural source of semantic informativeness. Using a minimal model-theoretic notion of informativeness-understood as the ability of sentences to distinguish among admissible models-we show that semantic completeness precludes informativeness, while incongruence preserves it. Moreover, incongruence is not confined to paradoxical constructions: any consistent incomplete first-order theory admits finite incongruent families arising from incompatible complete extensions. In this sense, incompleteness manifests structurally as locally realizable but globally incompatible semantic commitments, providing a minimal formal basis for semantic knowledge. Finally, we introduce a quantitative semantic framework. In a canonical finite semantic-state setting, we model semantic commitments as Boolean functions and define a Fourier-analytic notion of semantic energy based on total influence. We derive uncertainty-style bounds relating semantic determinacy, informativeness, and spectral simplicity, and establish a matrix inequality bounding aggregate semantic variance by total semantic energy. These results show quantitatively that semantic informativeness cannot collapse into a single determinate state without unbounded energy cost, identifying incongruence as a fundamental structural and quantitative feature of semantic representation.

Related papers

• What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction [0.0]
  This paper develops a single method, find what an accepted result silently assumed, make it a variable, and prove what follows once it is dropped.<n>It shows it keeps working across domains with nothing in common.
  arXiv  Detail & Related papers  (2026-08-02T03:10:44Z)
• Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability [46.784084625532984]
  This paper explores unsupervised disentangled representation learning from a functional perspective.<n>We prove that this condition yields identifiability of general nonlinear generative models.
  arXiv  Detail & Related papers  (2026-06-19T12:47:07Z)
• Uncertainty-DTW for Sequences and Visual Tokens [43.798398689900075]
  We introduce uncertainty-aware alignment, a probabilistic framework that models correspondences with heteroscedastic uncertainty and performs structured matching along alignment paths.<n>We generalize this framework from temporal sequences to tokenized visual representations, enabling structured matching over sets of visual tokens.<n>These findings establish uncertainty-aware alignment as a general, robust, and interpretable framework for learning from structured data.
  arXiv  Detail & Related papers  (2026-05-24T14:49:43Z)
• Evidential Information Fusion on Possibilistic Structure [53.34037686489798]
  We propose a reversible transformation between belief functions and a possibilistic structure defined on the power set.<n>We then introduce the triangular norm family to develop a general and adaptive evidential information fusion framework.<n>Unlike fusion methods rooted in Dempster semantics, the proposed framework supports more flexible combination behaviors.
  arXiv  Detail & Related papers  (2026-05-16T15:18:59Z)
• Diverse Dictionary Learning [47.381311762862985]
  Given only observational data $X = g(Z)$, where both the latent variables $Z$ and the generating process $g$ are unknown, recovering $Z$ is ill-posed without additional assumptions.<n>We show that intersections, complements, and symmetric differences of latent variables linked to arbitrary observations, along with the latent-to-observed dependency structure, are still identifiable up to appropriate indeterminacies.
  arXiv  Detail & Related papers  (2026-04-19T18:18:34Z)
• Semantic Channel Theory: Deductive Compression and Structural Fidelity for Multi-Agent Communication [7.299890614172539]
  This paper develops a rigorous framework for semantic communication.<n>It integrates formal proof systems with Shannon-theoretic tools.<n>A semantic bottleneck is identified in broadcast settings.
  arXiv  Detail & Related papers  (2026-04-10T02:08:24Z)
• Generalised contextuality of continuous variable quantum theory can be revealed with a single projective measurement [0.0]
  We show that a direct application of the standard definition of generalised contextuality to continuous variable systems does not envelope the statistics of some basic measurements.<n>We propose a modified definition of generalised contextuality for continuous-variable systems.
  arXiv  Detail & Related papers  (2026-01-20T15:24:26Z)
• Interaction-Conditional Semantics and the Dissolution of Quantum Paradoxes [0.0]
  I introduce four principles that license only configuration relative predication, grounding outcomes in physical measurement geometry while preserving objectivity.<n>Bell's theorem and the Kochen-Specker theorem are reframed not as dynamical mysteries but as constraints on permissible explanatory structure.
  arXiv  Detail & Related papers  (2026-01-20T01:22:22Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• SeSE: A Structural Information-Guided Uncertainty Quantification Framework for Hallucination Detection in LLMs [43.76748192880071]
  This paper presents a principled UQ framework that quantifies the inherent semantic uncertainty of large language models.<n>We develop an adaptively sparsified directed semantic graph construction algorithm that captures directional semantic dependencies.<n>We then exploit latent semantic structural information through hierarchical abstraction.
  arXiv  Detail & Related papers  (2025-11-20T11:54:12Z)
• The Theory of the Unique Latent Pattern: A Formal Epistemic Framework for Structural Singularity in Complex Systems [2.44755919161855]
  This paper introduces the Theory of the Unique Latent Pattern (ULP), a formal framework that redefines the origin of apparent complexity in dynamic systems.<n>Rather than attributing unpredictability to intrinsic randomness or emergent nonlinearity, ULP asserts that every analyzable system is governed by a structurally unique, deterministic generative mechanism.
  arXiv  Detail & Related papers  (2025-05-24T19:52:28Z)
• Kernel Language Entropy: Fine-grained Uncertainty Quantification for LLMs from Semantic Similarities [79.9629927171974]
  Uncertainty in Large Language Models (LLMs) is crucial for applications where safety and reliability are important. We propose Kernel Language Entropy (KLE), a novel method for uncertainty estimation in white- and black-box LLMs.
  arXiv  Detail & Related papers  (2024-05-30T12:42:05Z)
• 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)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs) [1.5828697880068698]
  We study the adaptation of admissibility-based semantics to Strength-based Argumentation Frameworks (StrAFs) Especially, we show that the strong admissibility defined in the literature does not satisfy a desirable property, namely Dung's fundamental lemma. We propose a translation in pseudo-Boolean constraints for computing (strong and weak) extensions.
  arXiv  Detail & Related papers  (2022-07-05T18:42:04Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)
• Bypassing the Kochen-Specker theorem: an explicit non-contextual statistical model for the qutrit [0.0]
  We describe an explicitly non-contextual statistical model of hidden variables for the qutrit. We observe that the existence of such an absolute frame of reference is not required by fundamental physical principles.
  arXiv  Detail & Related papers  (2018-05-13T19:37:33Z)

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.