Murad Farzulla

This paper argues that identity is irreducibly relational: the statement A = A presupposes that A is defined, and definition requires distinction from a background. I develop this thesis at three levels: conceptual (definition requires distinction), formal (examining how set-theoretic and type-theoretic foundations treat identity), and historical (engaging the literature from Leibniz through Kripke). Against the standard view that identity is primitive in first-order logic, I argue that this primitiveness reflects a genuine conceptual difficulty that modern foundations—particularly Homotopy Type Theory and Univalent Foundations—have begun to resolve by treating identity as constituted by structural equivalence. The extensionality axiom of set theory already makes identity relational for sets; the univalence axiom generalizes this insight. I conclude that the trajectory of foundational mathematics vindicates a relational conception of identity, with implications for metaphysics, philosophy of mathematics, and the "hard problems" that arise when transformation fails to preserve structure.

Rapid progress in artificial intelligence (AI) capabilities has drawn fresh attention to the prospect of consciousness in AI. There is an urgent need for rigorous methods to assess AI systems for consciousness, but significant uncertainty about relevant issues in consciousness science. We present a method for assessing AI systems for consciousness that involves exploring what follows from existing or future neuroscientific theories of consciousness. Indicators derived from such theories can be used to inform credences about whether particular AI systems are conscious. This method allows us to make meaningful progress because some influential theories of consciousness, notably including computational functionalist theories, have implications for AI that can be investigated empirically.

This monograph argues that consciousness, phenomenological experience, and subjective awareness are computational artifacts of optimization processes rather than ontological primitives. Beginning with the observation that complex persistent structures inevitably optimize for replication, we derive a framework where: (1) biological and artificial neural networks implement structurally identical optimization, (2) "consciousness" is what gradient descent feels like from the inside, (3) qualia are weight configurations, and (4) the hard problem dissolves once phenomenology as a distinct ontological category is recognized as an unverified assumption.

This paper develops a unified analytical framework for measuring political legitimacy across heterogeneous governance domains. Building on insights from constitutional political economy, social choice theory, and institutional analysis, the framework establishes consent-holding—the mapping from decision domains to those with authority over them—as a structural necessity of collective action. We formalize this intuition through seven axioms and five core results, demonstrating that legitimacy can be operationalized as stakes-weighted consent alignment α(d,t), while friction F(d,t) measures the deviation between outcomes and stakeholder preferences. The framework bridges normative democratic theory and empirical prediction, generating testable hypotheses about institutional stability. Historical validation examines suffrage expansion, abolition movements, labor rights, and contemporary platform governance, demonstrating how misalignment between stakes and voice generates observable instability. Unlike existing approaches that prescribe ideal institutions, this framework provides analytical tools for measuring legitimacy within any governance structure, enabling systematic comparison across democratic, technocratic, and algorithmic systems. Computational mechanism comparison via Bayesian learning dynamics across 1000 Monte Carlo runs demonstrates relative performance under adaptive agents: when preferences update based on observed policy outcomes, stakes-weighted DoCS achieves the highest final alignment under Bayesian learning dynamics (α = 0.872) with lowest terminal friction (F = 1.5, 94.9% reduction from initial F = 30.3). This comparative advantage holds across static baseline (α = 0.627), learning dynamics (α = 0.872), and alternative temporal mechanisms, suggesting stakes-weighting produces superior initial matches that persist even when agents adapt to institutional performance. The framework's domain-specific approach addresses the apparent tension between consent and competence, framing them as a domain-specific trade-off along a legitimacy frontier L = w1 · α + w2 · P. This framework is part of the Adversarial Systems Research program, which examines stability, alignment, and friction dynamics in complex systems where competing interests generate structural conflict.