Related papers: Solovay-type characterizations for forcing-algebra…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

Model semantics for first-order predicate logic is characterized by a visual inference tool called semantic forcing trees for predicate logic. Formulas that are valid (or invalid) by semantic forcing trees match valid (or invalid) formulas…

Recently Tomasz Natkaniec in [On lineability of families of non-measurable functions of two variable. Rev. R. Acad. Cienc. Exactas F\'is. Nat. Ser. A Mat. RACSAM, 115(1):Paper No. 33, 10, 2021] studied the lineability problem for several…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

We investigate the norms appearing in the forcing from combinatorial point of view. We make first steps towards building a catalog of the norms appearing in multiple settings and sources, reviewing four norms from Bartoszy\'nski and Judah…

In this article, we characterize completely alternating functions on an abelian semigroup $S$ in terms of completely monotone functions on the product semigroup $S\times \mathbb Z_+$. We also discuss completely alternating sequences induced…

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

We produce, relative to a ${\sf ZFC}$ model with a supercompact cardinal, a ${\sf ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega_1$ is $\Pi_1$-definable in a parameter from $H_{\aleph_2}$.

Let CBV denote the Banach algebra of all continuous real-valued functions of bounded variation, defined in [0,1]. We show that the set of strongly singular functions in CBV is nonseparably spaceable. We also prove that certain families of…

The paper demonstrates that falsifiability is fundamental to learning. We prove the following theorem for statistical learning and sequential prediction: If a theory is falsifiable then it is learnable -- i.e. admits a strategy that…

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

We study measurable spaces equipped with a $\sigma$-ideal of negligible sets. We find conditions under which they admit a localizable locally determined version -- a kind of fiber space that describes locally their directions -- defined by…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this…

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…