Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.15080

Internal Languages for Thin Epsilon-Hyperdoctrines: Soundness, Completeness, and Rocq Formalization

Zoltán Gábor Molnár·Csaba Tóth
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a typed proof-term calculus for intuitionistic intensional first-order logic with Hilbert's epsilon-operator and prove its soundness and completeness with respect to hyperdoctrinal models with thin bicartesian closed setoid categories (BiCCCs) as fibres and formula-indexed witness selections. The calculus provides an explicit internal language for these epsilon-hyperdoctrines: for each fixed typed signature, its syntactic term model is initial for syntax-indexed, interpretation-preserving model morphisms, with uniqueness up to setoid equality. The nested epsilon syntax is organized by a well-founded dependency relation on formula labels. Concrete countermodels exhibit failure of excluded middle and show that formula conversion need not identify the selected witnesses. We also compare the full calculus with its epsilon-free and epsilon-only fragments. The principal constructions and metatheorems are formalized in Rocq. With setoid BiCCCs, proof irrelevance is a choice of equality, not the erasure of proofs: the proofs and their categorical operations remain available as the basis for a future proof-relevant categorical semantics.

Explore related subjects

math.LOcs.LOmath.CT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zoltán Gábor Molnár, Csaba Tóth. 2026-10-10. Internal Languages for Thin Epsilon-Hyperdoctrines: Soundness, Completeness, and Rocq Formalization. https://arxiv.org/abs/2610.15080

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

KEEP EXPLORING

Related papers

arXiv2026

Convex Team Logics

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We introduce propositional/modal team logics which are expressively complete for the class of all convex propositional/modal team properties. We also answer an open question concerning the expressive power of classical propositional logic extended with the nonemptiness atom NE: we show that it is expressively complete for the class of all convex and union-closed properties. A modal analogue of this result additionally yields an expressive completeness theorem for Aloni's (2022) Bilateral State-Based Modal Logic. There is a specific sense in which one of the propositional convex logics we introduce extends propositional dependence logic; this sense corresponds to the existence of a compositional translation between the two logics. Another of the convex logics extends propositional inquisitive logic in the same manner. We generalize the notion of uniform definability, as considered in the team semantics literature, to formalize this notion of compositional extension.

math.LO↗
arXiv2026

Hindman and Owings-like theorems without the Axiom of Choice

We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy). We study several variations of Hindman's theorem on $\mathbb Q$-vector spaces; notably, we show that the uncountable analog of Hindman's theorem fails for the additive group of $\mathbb R$ (under ZF), and for $\mathbb Q$-vector spaces of uncountable dimension (under DC if such dimension is not well-orderable), among other results. In contrast, for Owings-type configurations, we obtain several positive results, especially when assuming AD. These results highlight the interaction between determinacy, algebraic structure, and dimension in the study of infinite Ramsey theory without the Axiom of Choice.

math.LO↗
arXiv2026

Constructive equivalence between Brouwer's fixed-point theorem and weak König's lemma

In the context of constructive reverse mathematics, we show that Brouwer's fixed-point theorem and weak König's lemma (WKL) are equivalent. To derive WKL from Brouwer's fixed-point theorem, the construction of a continuous function on the unit square without fixed points due to Orevkov [Soviet Math. Doklady (1963), 1253--1256] is generalised to yield a uniformly continuous function on the unit square whose fixed points encode information about infinite paths of a given infinite tree.

math.LO↗