Search arXivSearch

arXiv · 2602.04488

Intentic Semantics for Potentialist Truthmaking

Abstract

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and hypothetical reasoning. The framework is developed for first-order logic in a purely relational language and is compatible with both classical and intuitionistic settings. Truthmaking is defined via a recursive construction over intentic states, yielding a semantic consequence relation that is shown to be sound and complete with respect to standard natural deduction. The resulting structure supports two natural extension relations, corresponding to truthmaking growth and hypothetical refinement, which are shown to satisfy the axioms governing Linnebo's bi-modal potentialist semantics. Moreover, we investigate the computational properties of the non-hypothetical fragment of natural deduction. Motivated by proof-theoretic and semantic considerations, we formulate a conjecture that non-hypothetical logic is decidable over Peano Arithmetic in a purely relational axiomatization, and more ambitiously over any fixed Peano Arithmetic theorem taken as an additional axiom. A schematic proof-search procedure is drafted to support this conjecture, identifying structural sources of finiteness. While preliminary, this analysis suggests a strong subformula discipline for normal non-hypothetical proofs and provides a proof-theoretic foundation for future work.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Gorbow. 2026-02-04. Intentic Semantics for Potentialist Truthmaking. https://arxiv.org/abs/2602.04488

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

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO