Continuous first-order logic of abstract harmonic spaces

Haoming Wang

Home/Archive/arXiv

arXiv · 2604.14020

Continuous first-order logic of abstract harmonic spaces

Haoming Wang

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies Brelot harmonic spaces within an unbounded many-sorted continuous first-order language and its expansions. 1. In the finite evaluation reduct of the harmonic language, the Brelot theory together with the finite interpolation scheme eliminates bounded harmonic quantifiers while leaving point quantifiers untouched. 2. The Martin compactification is homeomorphic to a compact subset of the local type space, with the Martin boundary corresponding to non-principal types. 3. If the compact convex space of normalized positive harmonic functions is a Choquet simplex, then each Martin representing measure on the minimal boundary corresponds to a unique Keisler measure supported on minimal types and admits a complete lift. 4. Harnack compactness also implies stability of normalized evaluation formulas, yielding canonical bases and a harmonic barycenter factoring through Keisler measures. These constructions are further applied to fine potential theory, where boundary poles of potentials are Keisler null. First-jet expansions encode the Rad\'o--Kneser--Choquet and Lewy planar rigidity phenomena, while higher-dimensional failures are analyzed through thorn-forking chains in o-minimal expansions.

Explore related subjects

math.LO math.CV math.GN

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Haoming Wang. 2026-04-15. Continuous first-order logic of abstract harmonic spaces. https://arxiv.org/abs/2604.14020

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↗