Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.00363

At the Edge of Putnam's Program: Limitative Results For Computable Inductive Logics

Antoine Mercier·Josiah Lopez-Wild·Elijah Spiegel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The task of inductive logic is to develop a formal framework to analyze inductive reasoning. Historically this was accomplished by assigning probabilities to sentences of a logical language. Two natural criteria for such a system are: (i) the underlying language should be rich enough to express scientific hypotheses, and (ii) the probabilities should be, in some sense, accessible. The first criterion suggests that the language should at least contain the language of arithmetic, while the second suggests that probabilities should be computable. We show that these two criteria are in tension with one another. Various natural proposals for an inductive logic result in probabilities that are not arithmetically definable, much less computable. We isolate the assumptions responsible for this result, and search for a weaker inductive logic with more accessible probabilities. The most natural weakening results in probabilities that are arithmetically definable but still are not computable.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine Mercier, Josiah Lopez-Wild, Elijah Spiegel. 2026-05-29. At the Edge of Putnam's Program: Limitative Results For Computable Inductive Logics. https://arxiv.org/abs/2606.00363

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

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗