相关论文: On the Topological Complexity of Infinitary Ration…
In this paper, it is demonstrated that there is a parallelism between the relational interpretation of Rovelli and the interpretation of soft matter based on intermediate asymptotics. The general interpretation of physics strongly assumes…
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Relational reasoning is the ability to infer relations that jointly bind multiple entities, attributes, or variables. This ability is central to scientific reasoning, but existing evaluations of relational reasoning in large language models…
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
In this paper we give a generalization of the main results in \cite{ab,ab1} about $b$-ary expansions of algebraic numbers. As a byproduct we get a large class of new transcendence criteria. One of our corollaries implies that $b$-ary…
We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…
The following will be shown: Let $I$ be a $\sigma$-ideal on a Polish space $X$ with the property that the associated forcing of $I^+$ Borel subsets ordered by $\subseteq$ is a proper forcing. Let E be an analytic or coanalytic equivalence…
Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…
We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…
It has been proved by the author [arXiv: 2404.19433] that the Arens-Michael envelope of a solvable Lie algebra is a homological epimorphism. We show here that for algebras of analytic functionals on a connected complex Lie group the…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric structures and a version of the Lopez-Escobar theorem. We also…
We prove that for any homogeneous structure $\mathbf{K}$ in a language with finitely many relation symbols of arity at most two satisfying SDAP$^+$ (or LSDAP$^+$), there are spaces of subcopies of $\mathbf{K}$, forming subspaces of the…
We explore orbits, rational invariant functions, and quotients of the natural actions of connected, not necessarily finite dimensional subgroups of the automorphism groups of irreducible algebraic varieties. The applications of the results…
On every set A there is a rigid binary relation, i.e. such a relation R that there is no homomorphism (A,R)->(A,R) except the identity (Vopenka et al. [1965]). We state two conjectures which strengthen this theorem. We prove these…
We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…
In 1932, G\"odel proved that there is no finite semantics for intuitionistic logic. We consider all fragments of intuitionistic logic and check in each case whether a finite semantics exists. We may fulfill a didactic goal, as little logic…
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…
Starting from the orthogonal polynomial expansion of a function $F$ corresponding to a finite positive Borel measure with infinite compact support, we study the asymptotic behavior of certain associated rational functions…