English
Related papers

Related papers: The problem of Horn and Tarski

200 papers

In this paper, we prove that if two finite groups G and H have isomorphic Burnside rings, then G and H are the same order type groups, and give an example to show that the Burnside rings of the same order type groups are not necessarily…

Group Theory · Mathematics 2023-03-17 Yu Li , Wujie Shi

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…

Computational Complexity · Computer Science 2026-04-06 Leonid Dorochko , Michał Wrona

In 1950 Maharam asked whether every disintegration of a $\sigma$-finite measure into $\sigma$-finite measures is necessarily uniformly $\sigma$-finite. Over the years under special conditions on the disintegration, the answer was shown to…

Logic · Mathematics 2013-03-15 Karl Backs , Steve Jackson , R. Daniel Mauldin

Let $A$ and $B$ be finite ordered sets. We show that if the ordered sets of isotone self-maps $A^A$ and $B^B$ (ordered pointwise) are isomorphic, then $A$ and $B$ are isomorphic. This resolves a question originating with D. Duffus in 1978,…

Rings and Algebras · Mathematics 2025-10-02 G. Grätzer

We revisit classical gradient characterizations of quasiconvexity and provide corrected proofs that close gaps in earlier arguments. For the differentiable case of $\sigma$-quasiconvexity, we establish the full equivalence between several…

Optimization and Control · Mathematics 2025-11-27 Nguyen Xuan Duy Bao , Nguyen Mau Nam

We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinability Theorem (1933), Godel-Carnap's Diagonal Lemma (1934), and Rosser's (strengthening of Godel's first) Incompleteness Theorem (1936), whose proofs resemble much and…

Logic · Mathematics 2022-10-18 Saeed Salehi

We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-$\aleph_1$, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's…

Logic · Mathematics 2015-02-20 Joan Bagaria , Saharon Shelah

In this paper, we demonstrate that Li's fixed point theorems are indeed equivalent with the primitive Caristi's fixed point theorem, Jachymski's fixed point theorems, Feng and Liu's fixed point theorems, Khamsi's fixed point theorems and…

Functional Analysis · Mathematics 2010-10-06 Wei-Shih Du

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…

Group Theory · Mathematics 2016-06-02 Seyed Hassan Alavi , Ashraf Daneshkhah , Hosein Parvizi Mosaed

There are three natural ways to define UHF (uniformly hyperfinite) C*-algebras, and all three definitions are equivalent for separable algebras. In 1967 Dixmier asked whether the three definitions remain equivalent for not necessarily…

Operator Algebras · Mathematics 2010-02-22 Ilijas Farah , Takeshi Katsura

Man\v{c}inska and Roberson introduced quantum graph homomorphisms as the existence of perfect quantum strategies for graph homomorphism games. The resulting relation is a quasi-order on finite graphs, and hence gives a partial order after…

Combinatorics · Mathematics 2026-05-20 Yangjing Long

Different notions for order convergence have been considered by various authors. Associated to every notion of order convergence corresponds a topology, defined by taking as the closed sets those subsets of the poset satisfying that no net…

Functional Analysis · Mathematics 2020-12-29 Kevin Abela , Emmanuel Chetcuti , Hans Weber

Extending the study of spherically symmetric metrics satisfying the dominant energy condition and exhibiting singularities of power-law type initiated in SI93, we identify two classes of peculiar interest: focusing timelike singularity…

General Relativity and Quantum Cosmology · Physics 2010-11-19 Marie-Noelle Celerier , Peter Szekeres

Building on previous work of [BPS] we investigate $\sigma$-closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by showing that (1) every $\sigma$-closed partial order of…

Logic · Mathematics 2013-03-05 Bohuslav Balcar , Michal Doucha , Michael Hrušák

Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there are 2 to the alpha many varieties of geometric (i.e.,…

Logic · Mathematics 2018-03-30 H. Andréka , I. Németi

In 1958, Sierpinski asked whether there exists a linear order $X$ that is isomorphic to its lexicographically ordered cube but is not isomorphic to its square. The main result of this paper is that the answer is negative. More generally, if…

Logic · Mathematics 2016-09-28 Garrett Ervin

We address an old open question in convex geometry that dates back to the work of Minkowski: what are the equality cases of the monotonicity of mixed volumes? The problem is equivalent to that of providing a geometric characterization of…

Metric Geometry · Mathematics 2025-07-29 Ramon van Handel , Shouda Wang

We compute the $K_1$-group of ultraproducts of unital, simple $C^*$-algebras with unique trace and strict comparison. As an application, we prove that the reduced free group $C^*$-algebras $C^*_r(F_m)$ and $C^*_r(F_n)$ are elementarily…

Operator Algebras · Mathematics 2025-04-18 Srivatsav Kunnawalkam Elayavalli , Christopher Schafhauser

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

Logic · Mathematics 2019-07-02 Ziba Assadi , Saeed Salehi
‹ Prev 1 2 3 10 Next ›