English
Related papers

Related papers: More Jonsson algebras

200 papers

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

Logic · Mathematics 2016-09-06 Menachem Kojman

The first examples of formations which are arboreous (and therefore Hall) but not freely indexed (and therefore not locally extensible) are found. Likewise, the first examples of solvable formations which are freely indexed and arboreous…

Group Theory · Mathematics 2018-10-05 Karl Auinger , Alexander Bors

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

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Logic · Mathematics 2007-05-23 Saharon Shelah , Masahiro Shioya

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

Logic in Computer Science · Computer Science 2018-05-10 Alexis Bès , Christian Choffrut

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…

Logic · Mathematics 2016-01-15 Saharon Shelah

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

Logic · Mathematics 2022-02-22 Assaf Rinot , Jing Zhang

Suppose that there is a measurable cardinal. If \aleph_\omega is a strong limit cardinal, but the power of \aleph_\omega is bigger than \aleph_{\omega_1}, then there is an inner model with a Woodin cardinal. Modulo the need of the…

Logic · Mathematics 2007-05-23 Ralf Schindler

We show that every Jonsson cardinal is Ramsey in the Steel core model, provided that this model exists and there is no model with a Woodin cardinal. This basic result is improved in two directions. First, we prove the same result for…

Logic · Mathematics 2016-09-07 William Mitchell

Let p be an odd prime. When n>2, we show that each tensor factor of form E \otimes \Gamma in H(Z,n;Z_p) is an A-infinity bialgebra with non-trivial structure. We give explicit formulas for the structure maps and the quadratic relations…

Algebraic Topology · Mathematics 2010-09-07 A. Berciano , R. Umble

We prove several consistency results concerning the notion of $\omega$-strongly measurable cardinal in HOD. In particular, we show that is it consistent, relative to a large cardinal hypothesis weaker than $o(\kappa) = \kappa$, that every…

Logic · Mathematics 2023-02-16 Omer Ben-Neria , Yair Hayut

We find all finite Ockham algebras that admit only finitely many compatible relations (modulo a natural equivalence). Up to isomorphism and symmetry, these Ockham algebras form two countably infinite families: one family consists of the…

Rings and Algebras · Mathematics 2015-01-13 Brian A. Davey , Long T. Nguyen , Jane G. Pitkethly

In the present paper we indicate some Leibniz algebras whose closures of orbits under the natural action of $\GL_n$ form an irreducible component of the variety of complex $n$-dimensional Leibniz algebras. Moreover, for these algebras we…

Rings and Algebras · Mathematics 2015-04-07 A. Kh. Khudoyberdiyev , M. Ladra , K. K. Masutova , B. A. Omirov

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…

Group Theory · Mathematics 2024-03-06 Samuel M. Corson , Alexander Olshanskii , Olga Varghese

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…

Logic · Mathematics 2007-05-23 Arthur W. Apter , James Cummings , Joel David Hamkins

The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and…

High Energy Physics - Theory · Physics 2015-06-26 Kh. S. Nirov

Krueger showed that PFA implies that for all regular $\Theta \ge \aleph_2$, there are stationarily many $[H(\Theta)]^{\aleph_1}$ that are internally club but not internally approachable. From countably many Mahlo cardinals, we force a model…

Logic · Mathematics 2024-04-24 Hannes Jakob , Maxwell Levine

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

Logic in Computer Science · Computer Science 2018-05-07 Alexis Bès , Christian Choffrut
‹ Prev 1 3 4 5 6 7 10 Next ›