Related papers: Beth Definability in the Logic KR

Relational verification encompasses information flow security, regression verification, translation validation for compilers, and more. Effective alignment of the programs and computations to be related facilitates use of simpler relational…

We argue that for the proof of Bell's theorem no assumptions about realism or free will are necessary. The key formula \[E(AB|a,b) = \int A(a,b,\lambda)B(a,b,\lambda)\rho(\lambda) d\lambda\] follows from the logic of plausible reasoning…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

Concept learning exploits background knowledge in the form of description logic axioms to learn explainable classification models from knowledge bases. Despite recent breakthroughs in neuro-symbolic concept learning, most approaches still…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

We prove that epimorphisms are surjective in certain categories of ordered F-algebras. It then turns out that epimorphisms are also surjective in the category of all (unordered) algebras of type F.

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this…

The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit…

Let $A$ be a finite-dimensional associative $k$-algebra with identity. The primary aim of this paper is to study the rationality properties of the group of all $k$-algebra automorphisms of $A$, as an affine algebraic group over an arbitrary…

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means of finite Hilbert calculi. On the side of negative…

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…

Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible…

Let O\_K be a complete discrete valuation ring. Denote by K its fractions field and by k its residue field. Assume that k is of characteristic p>0 and perfect. Breuil gives an anti-equivalence between the category of finite flat O\_K-group…

We show that in an ultraproduct of finite fields, the mod-$n$ nonstandard size of definable sets varies definably in families. Moreover, if $K$ is any pseudofinite field, then one can assign "nonstandard sizes mod $n$" to definable sets in…

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

For uniformly dicrete metric spaces without bounded geometry we suggest a modified version of property A based on metrics of bounded geometry greater than the given metric. We show that this version still implies coarse embeddability in…

In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…

This is a revised version of ANT-0049. Given an elliptic curve E --> B over a base B with zero section i, we denote, letting E':= E - i(B), by L(E) the Q-vector space with basis ({s}, s \in E'(B)). Assume that B is smooth and separated over…