English
Related papers

Related papers: On \Sigma^1_1-complete Equivalence Relations on th…

200 papers

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…

Operator Algebras · Mathematics 2013-07-16 Marcin Sabok

Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.

Rings and Algebras · Mathematics 2015-09-30 Jason Bell , James J. Zhang

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Group Theory · Mathematics 2024-11-20 Ben Hayes , Srivatsav Kunnawalkam Elayavalli

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Logic in Computer Science · Computer Science 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

Logic · Mathematics 2018-12-07 Miloš S. Kurilić

$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…

Logic · Mathematics 2022-09-20 David Schrittesser

We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity…

Computational Complexity · Computer Science 2008-08-06 Barnaby Martin

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

Dynamical Systems · Mathematics 2016-02-29 S. Saito , N. Saitoh , T. Hatanaka , Y. Wakimoto , T. Yumibayashi

We prove several results of the following type: given finite dimensional normed space V possessing certain geometric property there exists another space X having the same property and such that (1) log (dim X) = O(log (dim V)) and (2) every…

Functional Analysis · Mathematics 2007-05-23 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

Rings and Algebras · Mathematics 2007-05-23 U. D. Bekbaev , I. S. Rakhimov

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

Computational Complexity · Computer Science 2012-06-13 Stefan Göller , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Felix Weiss

In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…

Logic · Mathematics 2019-01-29 Saharon Shelah

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on null-filiform associative algebras.

Rings and Algebras · Mathematics 2026-03-10 Kobiljon Abdurasulov , Jobir Adashev , Feruza Toshtemirova

Let $X$ be a complex smooth projective variety, and $\mathcal{G}$ a locally free sheaf on $X$. We show that there is a 1-to-1 correspondence between pairs $(\Lambda,\Xi)$, where $\Lambda$ is a sheaf of almost polynomial filtered algebras…

Algebraic Geometry · Mathematics 2012-03-23 Pietro Tortella

We construct a model in which the continuum has size $\kappa$ for a regular cardinal $\kappa$ and in which the $\Sigma^1_n$-uniformization property holds simultaneously for every $n \ge 2$. Additionally this model has a $\Delta^1_3$-…

Logic · Mathematics 2025-06-17 Stefan Hoffelner

We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…

Dynamical Systems · Mathematics 2013-03-14 Su Gao , Aaron Hill

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

General Topology · Mathematics 2025-07-29 Anton Lipin