逻辑
In [O. Le Gal, J.-P. Rolin. An o-minimal structure which does not admit $C^\infty$ cellular decomposition. In: Ann. Inst. Fourier 59 (2009), pp 543-562], the authors construct an o-minimal structure which does not admit smooth…
We introduce an intuitionistic modal logic strictly contained in the intuitionistic modal logic IK and being an appropriate candidate for the title of ``minimal normal intuitionistic modal logic''.
Consider an expansion $\mathcal R=(R,<,+,\ldots)$ of an ordered divisible Abelian group of finite burden defining no nonempty subset $X$ of $R$ which is dense and codense in a definable open subset $U$ of $R$ with $X \subseteq U$. We…
In this paper we study the relation between the category of real Lie groups and that of groups definable in o-minimal expansions of the real field, which we will refer to as ``definable groups''. With this terminology, it is known…
Most ideas about what an algorithm is are very similar. Basic operations are used for transforming objects. The evaluation of internal and external states by relations has impact on the further process. A more precise definition can lead to…
In this paper, we propose to connect Prawitz's theory of grounds with Girard's Ludics. This connection is carried out on two levels. On a more philosophical one, we highlight some differences between Prawitz's and Girard's approaches, but…
Addressing a question of Erdos and Hajnal we show that one can force a graph with no large independent sets and no monochromatic triples as successors of strong limit singular cardinals, even without assuming GCH. The result can be pushed…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
We take up Dedekind's question ''Was sind und was sollen die Zahlen?'' (''What are numbers, and would should they be?''), with the aim to describe the place that Conway's (Surreal) Numbers and Games take, or deserve to take, in the whole of…
Pierce identified 3 invariants of a compact metrisable Boolean space, derived from its Cantor-Bendixson sequence, that determine the space up to homeomorphism. For locally compact spaces we define an additional invariant, the compact rank,…
In the past couple of years a rich connection has been found between the fields of descriptive set theory and distributed computing. Frequently, and less surprisingly, finitary algorithms can be adopted to the infinite setting, resulting in…
We study the problem of when, given a countable homogeneous structure $M$ and a space $S$ of expansions of $M$, every $\mathrm{Aut}(M)$-invariant probability measure on $S$ is exchangeable (i.e. invariant under all permutations of the…
It is shown that there is $N$ such that there is no algorithm to decide for identities in at most $N$ variables validity in the class of finite modular lattices. This is based on Slobodskoi's result that the Restricted Word Problem is…
We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
In this paper, we demonstrate that if, for every $\kappa$-complete fine filter $F$ over $\mathcal{P}_{\kappa}\lambda$, the associated Namba forcing $\mathrm{Nm}(\kappa,\lambda,F)$ is semiproper, then $\square(\mu,{<}\aleph_1)$ fails for all…
In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.
The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…