English
Related papers

Related papers: Constructing Ultrapowers from Elementary Extension…

200 papers

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

Logic · Mathematics 2025-02-25 Zalán Molnár

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

Logic · Mathematics 2015-03-20 Joel David Hamkins , Daniel Evan Seabold

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

Logic · Mathematics 2015-03-17 Juan Carlos Martinez , Lajos Soukup

Given a clone C on a set A, we characterize the clone of operations on A which are local term operations of every ultrapower of the algebra $(A; C)$.

Logic · Mathematics 2022-09-27 Keith A. Kearnes , Agnes Szendrei

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

Rings and Algebras · Mathematics 2020-11-30 Erhard Aichinger

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…

Logic in Computer Science · Computer Science 2022-10-26 Antonio Bucciarelli , Antonio Ledda , Francesco Paoli , Antonino Salibra

Let $\Omega \subset \mathbb{C}^n$ be a bounded domain and let $\mathcal{A} \subset \mathcal{C}(\bar{\Omega})$ be a uniform algebra generated by a set $F$ of holomorphic and pluriharmonic functions. Under natural assumptions on $\Omega$ and…

Complex Variables · Mathematics 2016-08-14 Håkan Samuelsson , Erlend Fornæss Wold

We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…

Logic · Mathematics 2021-01-19 Antonio Bucciarelli , Antonino Salibra

Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…

Number Theory · Mathematics 2017-07-19 Ja Kyung Koo , Dong Hwa Shin

Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…

Logic · Mathematics 2009-09-25 Renling Jin , Saharon Shelah

In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…

Rings and Algebras · Mathematics 2015-04-10 Dmitriy Zhuk

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

We prove that algebraic isomorphisms between limit algebras are automatically continuous, and consider consequences of this result. In particular, we give partial solutions to a conjecture of Power [Limit Algebras, Longman, 1992, Notes to…

Operator Algebras · Mathematics 2007-05-23 Allan P. Donsig , Tim D. Hudson , Elias G. Katsoulis

A uniform space is said to be non-Archimedean if it is generated by equivalence relations. If $\lambda$ is a cardinal, then a non-Archimedean uniform space $(X,\mathcal{U})$ is $\lambda$-totally bounded if each equivalence relation in…

General Topology · Mathematics 2012-07-03 Joseph Van Name

Let $A$ be an associative algebra over a field of characteristic $\neq 2$ that is generated by a finite collection of nilpotent elements. We prove that all Lie derived powers of $A$ are finitely generated Lie algebras.

Rings and Algebras · Mathematics 2017-12-21 Adel Alahmadi , Hamed Alsulami

The notion of overlap algebra introduced by G. Sambin provides a constructive version of complete Boolean algebra. Here we first show some properties concerning overlap algebras: we prove that the notion of overlap morphism corresponds…

Logic · Mathematics 2012-03-23 Francesco Ciraulo , Maria Emilia Maietti , Paola Toto

For a locally compact group $G$, we show that it is possible to present the class of continuous unitary representations of $G$ as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how…

Classical Analysis and ODEs · Mathematics 2021-11-05 Itaï Ben Yaacov , Isaac Goldbring

We prove that if $\mathbb A$ is an algebra that is supernilpotent with respect to the $2$-term higher commutator, and $\mathbb B$ is a subalgebra of $\mathbb A$, then $\mathbb B$ is representable as a retract of a finite subdirect power of…

Group Theory · Mathematics 2020-05-07 Keith A. Kearnes , Alexander Rasstrigin

We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…

Logic · Mathematics 2013-04-03 Tarek Sayed Ahmed

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente
‹ Prev 1 2 3 10 Next ›