Related papers: An instance of Vaught's conjecture using algebraic…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We prove an effective version of the Pila-Wilkie Theorem for sets definable using Pfaffian functions, providing effective estimates for the number of algebraic points of bounded height and degree lying on such sets. We also prove effective…
We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
In this article, we investigate the quantitative unique continuation properties of real-valued solutions to elliptic equations in the plane. Under a general set of assumptions on the operator, we establish quantitative forms of Landis'…
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…
A complete theory ${\mathcal T}$ of partial order is an FLD$_1$-theory iff some (equivalently, any) of its models ${\mathbb X}$ admits a finite lexicographic decomposition ${\mathbb X} =\sum _{{\mathbb I}}{\mathbb X} _i$, where ${\mathbb…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
I. Penkov and V. Serganova have recently introduced, for any non-degenerate pairing $W\otimes V\to\mathbb C$ of vector spaces, the Lie algebra $\mathfrak{gl}^M=\mathfrak{gl}^M(V,W)$ consisting of endomorphisms of $V$ whose duals preserve…
We prove in ZFC, no psi in L_{omega_1,omega}[Q] have unique model of uncountable cardinality, this confirms theBaldwin conjecture. But we analyze this in more general terms. We introduce and investigate a.e.c. and also versions of limit…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…
We continue the research of the relation $\hspace{1mm}\widetilde{\mid}\hspace{1mm}$ on the set $\beta {\mathbb{N}}$ of ultrafilters on ${\mathbb{N}}$, defined as an extension of the divisibility relation. It is a quasiorder, so we see it as…
Let $k,\ell\geq 2$ be two multiplicatively independent integers. Cobham's famous theorem states that a set $X\subseteq \mathbb{N}$ is both $k$-recognizable and $\ell$-recognizable if and only if it is definable in Presburger arithmetic.…