Searcharxiv⌕ Search

arXiv · 2611.18300

Arithmetical and set-theoretic semantics of the logic of problems and propositions

Abstract

Kolmogorov interpreted intuitionistic logic as a calculus of problems and later remarked that a complete treatment should deal with problems and propositions together. Melikhov's logic HC is such a joint two-sorted system: it combines classical propositions with intuitionistic problems by means of two modalities, the problem !A (``find a proof of the proposition A'') and the proposition phi (``the problem phi has a solution''). We give the language of HC a formal semantics in which the modalities are read literally: solutions of !A are proofs of A in a fixed formal theory, ?phi states that phi has a solution, and the connectives on problems are interpreted as in Kleene realizability. Three variants are studied: the arithmetical semantics I (provability in PA), its external version E (truth in the standard model), and the set-theoretic semantics B over ZF, where problem variables are ``black boxes'' and a quantifier Pi over them is available. Validity is defined as the existence of a computable uniform solution. We determine which schemes are valid, build calculi HCI, HCE, HCB sound with respect to the three semantics, and derive Lob's scheme from the fixed-point lemma inside the common core of our calculi and HC. The propositional fragments of HCI and HCE are exactly the provability logics GL and GLS; the positive modality-free fragment of valid problems is intuitionistic logic, while the full modality-free fragment lies strictly above it (Rose's formula is valid, Scott's principle is not). We compare the calculi with HC, which turns out to be incompatible with fixed points, prove independence results and list open questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasia Onoprienko, Nikolay Vereshchagin. 2026-11-13. Arithmetical and set-theoretic semantics of the logic of problems and propositions. https://searcharxiv.com/abs/2611.18300

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗