逻辑
This paper presents a study of the finite axiomatizability of transitive logics of finite depth and finite weak width. We prove the finite axiomatizability of each transitive logic of finite depth and of weak width $1$ that is characterized…
It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…
This article is the text of a commentary on a talk delivered by Mark Textor entitled 'Brentano's Positing Theory of Existence' in December 2015. It contains ideas on implementing Textor's Neo-Brentanian theory of existence in a natural…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
We study a strengthening of the notion of a universally meager set and its dual counterpart that strengthens the notion of a universally null set. We say that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager…
We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…
Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…
We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…
We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…
We show that there is a set of $2^{2^{\kappa}}$ ultrafilters incomparable in Rudin-Frol\'ik order of $\beta \kappa \setminus \kappa$, where $\kappa$ is regular, for which no subset with more than one element has an infimum.
The aim of this paper is to construct chains of length $(2^\kappa)^+$ in the sense of Rudin-Frol\'ik order in $\beta \kappa$ for $\kappa$ regular.
In previous work we defined and studied a notion of typicality, originated with B. Russell, for properties and objects in the context of general infinite first-order structures. In this paper we consider this notion in the context of finite…
A family $\mathcal{A} \subseteq [\omega]^\omega$ such that for all finite $\{X_i\}_{i\in n}\subseteq \mathcal A$ and $A \in \mathcal{A} \setminus \{X_i\}_{i\in n}$, the set $A \setminus \bigcup_{i \in n} X_i$ is infinite, is said to be…
Was paper 839 in the author's list until winter 2023 when it was divided into three. Part I: We would like to generalize imaginary elements, weight of ortp$(a,M,N), {\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [She90, Ch.…
In the lecture notes it is shown that an ordinal $\psi_{\Omega}(\varepsilon_{\mathbb{S}^{+}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\omega+(M\prec_{\Sigma_{1}}V)$. In this note we show that ${\sf…
We investigate the Friedman--Goldfarb--Harrington theorem from two perspectives. Firstly, in the frameworks of classical and modal propositional logics, we study the forms of sentences whose existence is guaranteed by the FGH theorem.…
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…
We introduce three measures of complexity for families of sets. Each of the three measures, that we call dimensions, is defined in terms of the minimal number of convex subfamilies that are needed for covering the given family: for upper…