逻辑
This is a plain English translation of [B\"{o}h68], originally in Italian, by Chun Tian. All footnotes (and citations only found in footnotes, of course) are added by the translator.
This short note is dedicated to the memory of the distinguish logician V. Yankov (Jankov).
We prove a positive polarized cube relation for infinite cardinals.
The symmetric strict implication calculus $\mathsf{S^2IC}$ is a modal calculus for compact Hausdorff spaces. This is established through de Vries duality, linking compact Hausdorff spaces with de Vries algebras-complete Boolean algebras…
We study the class of differentially henselian fields, which are henselian valued fields equipped with generic derivations in the sense of Cubides Kovacics and Point, and are special cases of differentially large fields in the sense of…
HMC sets are hereditarily at most countable sets. We rework a substantial part of univariate real analysis in a form in which only HMC real functions are used. In such countable real analysis we carry out Hilbert's proof of transcendence of…
Working in the context of reverse mathematics, we give a fine-grained characterization result on the strength of two possible definitions for Effective Transfinite Recursion used in literature. Moreover, we show that $\Pi^0_2$-induction…
A classic result in modal logic, known as the Blok Dichotomy Theorem, states that the degree of incompleteness of a normal extension of the basic modal logic $\sf K$ is $1$ or $2^{\aleph_0}$. It is a long-standing open problem whether Blok…
Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…
A Boolean ring and its Stone space (Boolean space) are primitive if the ring is disjointly generated by its pseudo-indecomposable (PI) elements. Hanf showed that a primitive PI Boolean algebra can be uniquely defined by a structure diagram.…
In this work, we investigate various combinatorial properties of Borel ideals on countable sets. We extend a theorem presented in M. Hru\v{s}\'{a}k, D. Meza-Alc\'antara, E. Th\"ummel, and C. Uzc\'ategui, \emph{Ramsey Type Properties of…
We introduce and study some general principles and hierarchical properties of expansions and restrictions of structures and their theories The general approach is applied to describe these properties for classes of $\omega$-categorical…
Let $T$ be a complete, model complete o-minimal theory extending the theory of real closed ordered fields and assume that $T$ is power bounded. Let $K$ be a model of $T$ equipped with a $T$-convex valuation ring $\mathcal{O}$ and a…
From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…
We develop infinitary analogues of the $N\times N\times N$ Rubik's cube. We'll be pushed to consider the possibility of transfinitely many twists and the foremost question we shall study is whether or not all infinite scrambles are…
Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…
This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…
We investigate natural variations of behaviourally correct learning and explanatory learning -- two learning paradigms studied in algorithmic learning theory -- that allow us to ``learn'' equivalence relations on Polish spaces. We give a…