Negation and Identity in a Modal Mode Theory

Juan Afanador

Home/Archive/arXiv

arXiv · 2401.01893

Negation and Identity in a Modal Mode Theory

Juan Afanador

View original source ↗Read source document ↗Export metadata ↓

Abstract

This piece threads substructurality and modality into a negation that activates the downside of equivalence and identity in a fibrational framework. The piece is a working through of negation and contradiction as type-theoretic/categorial objects, towards an immanent critique of the subtending univalent paradigm. Although this is not the terminus of the piece, i wish to try and delineate the epistemic and intra-mundane problematics intertwined therewith. The piece's terminus is a mode theory of an intuitionistic modal logic that internalises a restriction on the Double Negation Elimination rule.

Explore related subjects

cs.LO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Juan Afanador. 2023-09-02. Negation and Identity in a Modal Mode Theory. https://arxiv.org/abs/2401.01893

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Axiomatisation for an asynchronous epistemic logic with sending and receiving messages

We investigate a logic for asynchronous announcements wherein the sending of the messages by the environment is separated from their reception by the individual agents. Both come with different modalities. In the logical semantics, formulas are interpreted in a world of a Kripke model but given a history of prior announcements and receptions that already happened. An axiomatisation AA for such a logic has been given in prior work, for the formulas that are valid when interpreted in the Kripke model before any such announcements have taken place. This axiomatisation is a reduction system wherein one can show that every formula is equivalent to a purely epistemic formula without dynamic modalities for announcements and receptions. We propose a generalisation AA* of this axiomatisation, for the formulas that are valid when interpreted in the Kripke model given any history of prior announcements and receptions of announcements. It does not extend the axiomatisation AA, for example it is no longer valid that nobody has received any message. Unlike AA, this axiomatisation AA* is infinitary and it is not a reduction system.

cs.LO↗

arXiv2026

Mechanizing Gödel's Incompleteness Theorems and Provability Logic

We mechanized proof of Gödel's first and second incompleteness theorems, Solovay's arithmetical completeness theorem of \mathbf{GL}, and related results in the Lean 4 theorem prover.

cs.LO↗

arXiv2026

Vibe-Coded and Tuned: A State-of-the-Art SMT Solver for QF-LRA

This paper presents the SMT solver primo, which is fully vibe-coded and then parameter-tuned, achieving state-of-the-art results on linear real arithmetic (QF-LRA). The performance of primo is achieved by a systematic literature survey, repeated profiling, and parameter tuning. The resulting solver outperforms the winner of the QF-LRA track of SMT-COMP~2026. This confirms that vibe-coding of automated reasoning tools will enable us to make great strides in the future.

cs.LO↗