逻辑
We study relativized Lascar groups, which are formed by relativizing Lascar groups to the solution set of a partial type $\Sigma$. We introduce the notion of a Lascar tuple for $\Sigma$ and by considering the space of types over a Lascar…
We study some topics about \L o\'s's theorem without assuming the Axiom of Choice. We prove that \L o\'s's fundamental theorem of ultraproducts is equivalent to a weak form that every ultrapower is elementary equivalent to its source…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
In this paper we continue the study in [Gilton-Levine-Stejskalova] of compactness and incompactness principles at double successors, focusing here on the case of double successors of singulars of countable cofinality. We obtain models which…
We prove several preservation theorems for NATP and furnish several examples of NATP. First, we prove preservation of NATP for the parametrization and sum of the theories of Fra\"{i}ss\'{e} limits of Fra\"{i}ss\'{e} classes satisfying…
We introduce the concept of an abstract evolution system, which provides a convenient framework for studying generic mathematical structures and their properties. Roughly speaking, an evolution system is a category endowed with a selected…
In this paper we study the Lascar group over a hyperimaginary e. We verify that various results about the group over a real set still hold when the set is replaced by e. First of all, there is no written proof in the available literature…
This paper surveys work on the relation between fractal dimensions and algorithmic information theory over the past thirty years. It covers the basic development of prefix-free Kolmogorov complexity from an information theoretic point of…
The axiomatic system introduced by H\'ajek axiomatizes first-order logic based on BL-chains. In this study, we extend this system with the axiom $(\forall x \phi)^2 \leftrightarrow \forall x \phi^2$ and the infinitary rule \[ \frac{\phi…
We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…
Formal Concept Analysis starts from a very basic data structure comprising objects and their attributes. Sometimes, however, it is beneficial to also define attributes of attributes, viz., meta-attributes. In this paper, we use Triadic…
Given an uncountable subset $\mathcal Y$ of a nonseparable Banach space, is there an uncountable $\mathcal Z\subseteq \mathcal Y$ such that the distances between any two distinct points of $\mathcal Z$ are more or less the same? If an…
A significant part of contemporary research in autonomous vehicles is dedicated to the development of safety critical systems where state-of-the-art artificial intelligence (AI) algorithms, like computer vision (CV), can play a major role.…
The original notion of Solovay reducibility was introduced by Robert M. Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger…
Addressing a question of Shioya, we show that two-step iterations of the Laver collapse can force saturated ideals and Chang conjectures.
Paraconsistency is commonly defined and/or characterized as the failure of a principle of explosion. The various standard forms of explosion involve one or more logical operators or connectives, among which the negation operator is the most…
Rescue stations around the world receive millions of emergency rescue calls each year, most of which are due to health complications. Due to the high frequency and necessity of rescue services, there is always an increasing demand for…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
We have revised the softness property introduced by J\"org Brendle and Haim Judah (perfect sets of random reals. Israel J. Math., 83(1-2):153-176, 1993), to present a new definition of a class of posets called $\sigma$-soft-linked. Our work…
In this paper we give an ordinal analysis of a set theory extending ${\sf KP}\ell^{r}$ with an axiom stating that `there exists a transitive set $M$ such that $M\prec_{\Sigma_{1}}V$'.