逻辑
In this article, we introduce a hierarchy on the class of non-archimedean Polish groups that admit a compatible complete left-invariant metric. We denote this hierarchy by $\alpha$-CLI and L-$\alpha$-CLI where $\alpha$ is a countable…
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…
We study reduced products $M=\prod_n M_n/\mathrm{Fin}$ of countable structures in a countable language associated with the Fr\'echet ideal. We prove that such $M$ is $2^{\aleph_0}$-saturated if its theory is stable and not…
We describe the possible values of $K$-theory for $C(X)$ when $X$ is a co-existentially closed continuum. As a consequence we also show that all pseudo-solenoids, except perhaps the universal one, are not co-existentially closed.
We show the set of Hopfian countable groups is a complete co-analytic subset of the standard Borel space of countable groups, resolving a question posed by Simon Thomas (https://doi.org/10.1007/s00153-017-0597-9).
Inspired by Conway's surreal numbers, we study real closed fields whose value group is isomorphic to the additive reduct of the field. We call such fields omega-fields and we prove that any omega-field of bounded Hahn series with real…
We show that \'Ecalle's transseries and their variants (LE and EL-series) can be interpreted as functions from positive infinite surreal numbers to surreal numbers. The same holds for a much larger class of formal series, here called…
A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…
This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…
In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…
Motivated by Tsirelson's implicitly defined pathological Banach space, T. Gowers asked whether explicitly defined Banach spaces must include either $c_0$ or some $\ell^p$. J. Iovino and P. Casazza gave an affirmative answer for first-order…
The consistency of a second-order version of a theorem of Morley on the number of countable models was proved in arXiv:2107.07636 with the aid of large cardinals. We here dispense with them.
We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
First proved my Donald Martin in 1975, the result of Borel determinacy has been the subject of multiple revised proofs. Following Martin's book [1], we present a recent streamlined proof which implements ideas of Martin, Moschovakis, and…
We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical proposition [(Ax)R(x)] can be finitarily evidenced as:…
In the framework of graphs, we study abstract elementary classes (aecs). In this work we analyze several properties of Forb(G) and versions of Forb-Con(G) in the context of aecs and we present some examples of classes of graphs which…
We prove that Hensel minimal expansions of finitely ramified Henselian valued fields admit spherically complete immediate elementary extensions. More precisely, the version of Hensel minimality we use is $0$-hmix-minimality (which, in…
In this paper we show that cut-free derivations in the epsilon format of sequent calculus provide for a non-elementary speed-up w.r.t. cut-free proofs in usual sequent calculi in first-order language.
Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…