English
Related papers

Related papers: Ultrafilter extensions of linear orders

200 papers

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

Category Theory · Mathematics 2009-05-13 Daniel Litt , Zachary Abel , Scott D. Kominers

In [A. Stolz and A. Thom, On the lattice of normal subgroups in ultraproducts of compact simple groups, PLMS 108(1), 2014] it was stated that the lattice of normal subgroups of an ultraproduct of finite simple groups is always linearly…

Group Theory · Mathematics 2017-09-20 Jakob Schneider , Andreas Thom

In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…

Logic · Mathematics 2020-04-06 Armen Grigoryants

We study Frobenius extensions which are free-filtered by a totally ordered, finitely generated abelian group, and their free-graded counterparts. First we show that the Frobenius property passes up from a free-graded extension to a…

Rings and Algebras · Mathematics 2017-06-23 Stephane Launois , Lewis Topley

The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…

Logic · Mathematics 2023-06-13 Paolo Lipparini

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

Logic · Mathematics 2017-08-03 Almudena Colacito , George Metcalfe

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…

Logic · Mathematics 2021-03-17 Boris Šobot

A divisibility relation on ultrafilters is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also belongs to $\cal G$. After describing the…

Logic · Mathematics 2024-09-04 Boris Šobot

In these lectures we study some possible higher order (of degree greater than two) extensions of the Poincar\'e algebra. We first give some general properties of Lie superalgebras with some emphasis on the supersymmetric extension of the…

High Energy Physics - Theory · Physics 2009-07-22 M. Rausch de Traubenberg

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

Logic in Computer Science · Computer Science 2015-07-28 Haoxiang Lin

We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…

Logic · Mathematics 2020-11-12 Michael Wheeler

Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…

Logic in Computer Science · Computer Science 2025-03-06 C. B. Aberlé , Chris Martens , Frank Pfenning

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…

Number Theory · Mathematics 2019-09-25 Tommy Hofmann , Carlo Sircana

Given a semilattice $X$ we study the algebraic properties of the semigroup $\upsilon(X)$ of upfamilies on $X$. The semigroup $\upsilon(X)$ contains the Stone-Cech extension $\beta(X)$, the superextension $\lambda(X)$, and the space of…

Group Theory · Mathematics 2012-12-19 Taras Banakh , Volodymyr Gavrylkiv

Ultraproducts are a well-known tool in the classical model theory of first-order logic. We explore their uses in the context of finite model theory.

Logic · Mathematics 2013-10-14 Philip Dittmann

Non-trivial extensions of the three dimensional Poincar\'e algebra, beyond the supersymmetric one, are explicitly constructed. These algebraic structures are the natural three dimensional generalizations of fractional supersymmetry of order…

High Energy Physics - Theory · Physics 2008-11-26 M. Rausch de Traubenberg , M. J. Slupinski

We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…

Logic · Mathematics 2025-05-27 Vincent Mamoutou Bagayoko

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri