Related papers: Iterating the cofinality-$\omega$ constructible mo…

We consider finite approximations of a topological space $M$ by noncommutative lattices of points. These lattices are structure spaces of noncommutative $C^*$-algebras which in turn approximate the algebra $\cc(M)$ of continuous functions…

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

Let $K$ be a compact metric space and let $\gamma = (\gamma_1, \dots, \gamma_n)$ be a system of proper contractions on $K$. We study a C*-algebra $\mathcal{MC}_{\gamma_1, \dots, \gamma_n}$ generated by all multiplication operators by…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

If $\mathcal{L}$ is an abstract logic (a.k.a. model theoretic logic), we can define the inner model $C(\mathcal{L})$ by replacing first order logic with $\mathcal{L}$ in G\"odel's definition of the inner model $L$ of constructible sets. Set…

We construct reduced and full semigroup C*-algebras for left cancellative semigroups. Our new construction covers particular cases already considered by A. Nica and also Toeplitz algebras attached to rings of integers in number fields due…

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

Let $X$ be a locally compact non compact Hausdorff topological space. Consider the algebras $C(X)$, $C_b(X)$, $C_0(X)$, and $C_{00}(X)$ of respectively arbitrary, bounded, vanishing at infinity, and compactly supported continuous functions…

We study C*-algebras associated to right LCM semigroups, that is, semigroups which are left cancellative and for which any two principal right ideals are either disjoint or intersect in another principal right ideal. If $P$ is such a…

We study the model theory of countable right-angled buildings with infinite residues. For every Coxeter graph we obtain a complete theory with a natural axiomatisation, which is $\omega$-stable and equational. Furthermore, we provide sharp…

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

We prove the following consistency result for cardinal sequences of length $< \om_3$: if GCH holds and $\la \geq \om_2$ is a regular cardinal, then in some cardinal-preserving generic extension $2^{\om} = \la$ and for every ordinal $\eta <…

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

For a recollement $(\mathcal{D}B,\mathcal{D}A,\mathcal{D}C)$ of derived categories of algebras, we investigate when the functor $j^*:\mathcal{D}A\rightarrow\mathcal{D}C$ is an eventually homological isomorphism. In this context, we compare…

Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

In this note, we show that the first-order logic IK$^\omega$ is sound with regard to the models obtained from continuum-valued \L{}ukasiewicz-models for first-order languages by treating the quantifiers as infinitary strong…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…