arXiv:2607. 15629v1 Announce Type: cross Abstract: Topos causal models recast causal inference inside a topos: a causal world is a presheaf, an intervention is a characteristic map into the subobject classifier, and reasoning is carried out in the intuitionistic internal language.
By Karen Sargsyan
The paper introduces Preregistered Belief Revision Contracts (PBRC), a protocol that separates open communication from admissible epistemic change in deliberative multi-agent systems. PBRC fixes evidence triggers, revision operators, priority rules, and fallback policies, requiring that belief changes cite preregistered triggers and validated evidence tokens. The authors prove that PBRC prevents confidence inflation from conformity, preserves auditability, ensures epistemic accountability, and characterizes enforced belief trajectories under token-invariant contracts.
By Saad Alqithami
arXiv:2510. 17944v2 Announce Type: replace-cross Abstract: In this paper, we generalize Pearl's do-calculus to an Intuitionistic setting called $j$-stable causal inference inside a topos of sheaves.
By Sridhar Mahadevan
arXiv:2609.36279v1 Announce Type: cross
Abstract: The shallow embedding of higher-order modal logic in classical higher-order logic, used in Benzm\"uller and Scott's Notes on G\"odel's and Scott's va...
By Christoph Benzm\"uller
The paper introduces a semantic elevation operator that transforms static semantic questions about a program into dynamic questions about whether a property is preserved after the program rewrites itself. It proves that for intensional transformations the elevated property remains undecidable, showing that the class of non‑verifiable properties is closed under this operator and that repeated application climbs the arithmetical hierarchy to Υ02‑completeness. The work also demonstrates that no finite tower of verifiers can provide an unconditional certificate of preservation, and suggests a categorical perspective for future exploration.
By Jose Pascual Gumbau Mezquita
arXiv:2606. 16541v1 Announce Type: new Abstract: Autoformalization, translating natural-language mathematics into formal proof assistants, is bottlenecked not by translation fluency but by \emph{faithfulness}: a formal statement can typecheck and be provable, yet still encode a different theorem than the source intended.
By Noor Islam S. Mohammad, Tamim Sheikh