逻辑
In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
We revisit Dieter Spreen's notion of a representation associated to a numbered basis equipped with a strong inclusion relation. We show that by relaxing his requirements, we obtain different classically considered representations as…
We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}ss\'{e} limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado…
We prove a conservativity result for extensional type theories over propositional ones, i.e. dependent type theories with propositional computation rules, or computation axioms, using insights from homotopy type theory. The argument…
Given a $T$-rough definably amenable $T$-rough approximate subgroup $A$ of a group in some first-order structure, there is a type-definable subgroup $H$ normalised by $A$ and contained in $A^4$ of bounded index in $\langle A\rangle$.
The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…
A logic $L$ is called tabular if it is the logic of some finite frame and $L$ is pretabular if it is not tabular while all of its proper consistent extensions are tabular. In this work, we study pretabular tense logics in the lattice…
Denote by $\mathcal{NA}$ and $\mathcal{MA}$ the ideals of null-additive and meager-additive subsets of~$2^\omega$, respectively. We prove in ZFC that $\mathrm{add}(\mathcal{NA})=\mathrm{non}(\mathcal{NA})$ and introduce a new (Polish)…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…
We study possibilities of preservations for properties, their links and related connections between semantic and syntactic ones, both in general and as characterizations for subalgebras, congruence relations, Henkin construction,…
Chu spaces and Chu transforms were first investigated in category theory by Barr and Chu in 1979. In 2000 van Benthem shifted to the model-theoretic point of view by isolating a class of infinitary two-sorted properties, the flow formulas,…
Building on Buchholz' assignment for ordinals below Bachmann-Howard ordinal, see Buchholz 2003, we introduce systems of fundamental sequences for two kinds of relativized $\vartheta$-function-based notation systems of strength…
This paper deals with certain fundamental results about affine hulls and simplices in a real normed linear space. The framework of the paper is Bishop's constructive mathematics, which, with its characteristic interpretation of existence as…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragments of many logics obtained by adding various axioms to…
The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…
Working within the context of countable, superstable theories, we give many equivalents of a theory having NOTOP. In particular, NOTOP is equivalent to V-DI, the assertion that any type $V$-dominated by an independent triple is isolated…
We use hypotheses from PCF theory to construct a linear ordering which has cardinality the successor of a singular cardinal of countable cofinality, and is incompact in the following sense: the ordering is not sigma-scattered, but every…