逻辑

When working with posets which are not necessarily lattices, one has a lack of lattice operations which causes problems in algebraic constructions. This is the reason why we use the operators Max L and Min U substituting infimum and…

We present a counterexample to Conjecture~14.1.6 from [Vladimir Kanovei, Borel equivalence relations], regarding Borel equivalence relations on product spaces.

Bilateralism is the position according to which assertion and rejection are conceptually independent speech acts. Logical bilateralism demands that systems of logic provide conditions for assertion and rejection that are not reducible to…

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

We prove the consistency of the inequality $\mathfrak{r}_{\mathsf{nwd}}<\mathfrak{irr}$, which in turn implies the consistency of $\mathfrak{r}_\mathsf{nwd}<\mathfrak{i}$ and $\mathfrak{r}_{\mathsf{scatt}}<\mathfrak{irr}$. This answers one…

In classical logic, "P implies Q" is equivalent to "not-P or Q". It is well known that the equivalence is problematic. Actually, from "P implies Q", "not-P or Q" can be inferred ("Implication-to-Disjunction" is valid), whereas from "not-P…

We prove a result concerning elementary embeddings of the set-theoretic universe into itself (Reinhardt embeddings) and functions on ordinals that "eventually dominate" such embeddings. We apply that result to show the existence of…

We present a method for producing elementary embeddings from homomorphisms. This method is utilized in the study of the "strongly rigid relation principle" as defined by Hamkins and Palumbo in their paper "The Rigid Relation Principle, a…

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

We introduce "$n$-choiceless" supercompact and extendible cardinals in Zermelo-Fraenkel set theory without the Axiom of Choice. We prove relations between these cardinals and Vop\v{e}nka's Principle similar to those of Bagaria's work in his…

BSS RAMs over first-order structures help to characterize algorithms for processing objects by means of useful operations and relations. They are the result of a generalization of several types of abstract machines. We want to discuss…

We formulate and discuss a general axiomatic theory of arbitrary objects. This theory is expressed in a simple first-order language without modal operators, and it is governed by classical logic.

We analyse domination between invariant types in o-minimal expansions of ordered groups, showing that the domination poset decomposes as the direct product of two posets: the domination poset of an o-minimal expansion of a real closed…

We give a new axiomatic treatment of the Zilber trichotomy, and use it to complete the proof of the trichotomy for relics of algebraically closed fields, i.e., reducts of the ACF-induced structure on ACF-definable sets. More precisely, we…

We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and…

Johnstone demonstrated that Heyting semilattices form a semi-abelian category via a specific triple of terms. Inspired by this work, we introduce \emph{Johnstone algebras} or J-algebras. The algebraic $(*,\to,e)$-theory $J$ of arities…

The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…

Sandqvist's base-extension semantics (B-eS) for intuitionistic sentential logic grounds meaning relative to bases (rather than, say, models), which are arbitrary sets of permitted inferences over sentences. While his soundness proof is…