Skip to content
Preprint

Failure of Higher-Order Truth within Intuitionistic Propositional Logic

Aug 2026 · 2 citations · ⚡ 1 influential · 7 references
Mathematics

Abstract

We answer the question whether all Heyting algebras can appear as the lattice of subterminal objects of an elementary topos in the negative. Concretely, we show that the free Heyting algebra on two generators, hence also on N generators for every N greater than 2, cannot be such a Heyting algebra. The mathematical results in this document were obtained with the help of ChatGPT 5.6 Sol, although the document itself was written entirely by us, and we take full responsibility for its contents.

View source

Similar papers

Preprint Aug 2026

Translations between interior preorder structures and coherent neighbourhood systems for intuitionist modal logic

On this article we provide a relation between two inherently different semantic structures for intuitionistic modal logic. We start by recalling the Heyting Algebras, then defining the language and the axioms for the iS4h intuitionistic calculus. We then proceed to analyse two structures discussed on [4] and their rela...

Aliel Minatti Andrade, Rogerio Fajardo · 0 citations
Preprint Sep 2026

A decision procedure for intuitionistic modal logic IS4 (and IK4)

In this paper, we show that the two intuitionistic modal logics IS4 and IK4 are decidable. We provide a constructive decision procedure, that, given a formula, produces either a proof showing the formula to be valid or a finite countermodel falsifying the formula, thus also proving the finite model property for both lo...

Marianna Girlando, Roman Kuznets, Sonia Marin et al. · 1 citation
Preprint Sep 2026

Simplified proofs of Weak Normalization for propositional logic

We present a new proof of weak normalization for intuitionistic natural deduction. The distinguishing features of this proof are that it works only with cuts rather than cut segments, provides explicit local rules for determining whether to contract a whole proof or reduce one of its subproofs, and in the latter case,...

S. Suresh · 0 citations
Preprint Sep 2026

Exact Complexity of the Satisfiability Problem for Strategy Logic

We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Log...

Tikhon Pshenitsyn · 0 citations
Preprint Sep 2026

Two applications of the point-free coderivative

We present two new applications of Simmons'point-free Cantor-Bendixson coderivative operator in intuitionistic logic. First, we use it to give a simplified proof of the recent result of Xu and Ye that the free Heyting algebra on two generators does not occur as the Heyting algebra of subterminal objects in any elementa...

Zoltan A. Kocsis · 0 citations
Open access Sep 2026

Structures with Two Partial Orders and the Amalgamation Property

We show that partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser or finer partial order, or a linearization, or an auxiliary relation have the strong amalgamation property, Fraïssé limits and, in many cases, an \(\omega\)-categorical model completion with quantifier...

P. Lipparini · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.