English
Related papers

Related papers: Isomorphism property in nonstandard extensions of …

200 papers

We construct the \emph{inverse partition semigroup} $\mathcal{IP}_X$, isomorphic to the \emph{dual symmetric inverse monoid} $\mathcal{I}^{\ast}_X$, introduced in [6]. We give a convenient geometric illustration for elements of…

Group Theory · Mathematics 2007-05-23 Victor Maltcev

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…

Logic in Computer Science · Computer Science 2010-02-16 F. Bueno , J. Navas , M. Hermenegildo

Given a finite relational language $\calL$, a hereditary $\calL$-property is a class of finite $\calL$-structures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal…

Logic · Mathematics 2016-07-20 Caroline Terry

Let H be a semisimple finite dimensional Hopf algebra over a field F of zero characteristic. We prove three major theorems: 1. The Representability theorem which states that every H-module (associative) F-algebra W satisfying an ordinary…

Rings and Algebras · Mathematics 2015-09-02 Yaakov Karasik

In section 1 of this paper, we characterize the isomorphism property of nonstandard universes in terms of the realization of some second--order types in model theory. In section 2, several applications are given. One of the applications…

Logic · Mathematics 2008-02-03 Renling Jin , Saharon Shelah

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 Egbert Rijke

The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…

Programming Languages · Computer Science 2025-11-21 Bohdan Liesnikov , David Binder , Tim Süberkrüb

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

Logic in Computer Science · Computer Science 2026-05-01 Fatemeh Ghasemi , Julien Grange

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

Discrete Mathematics · Computer Science 2025-10-03 Antonin Callard , Léo Paviet Salomon , Pascal Vanier

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

cmp-lg · Computer Science 2008-02-03 Suresh Manandhar

Let $I$ denote an ideal of a local ring $(R,\mathfrak{m})$ of dimension $n$. Let $M$ denote a finitely generated $R$-module. We study the endomorphism ring of the local cohomology module $H^c_I(M), c = \grade (I,M)$. In particular there is…

Commutative Algebra · Mathematics 2014-05-13 Waqas Mahmood , Zohaib Zahid

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Dynamical Systems · Mathematics 2025-09-10 Robert Bland , Kevin McGoff

Given a symmetric linear transformation on a Hilbert space, a natural problem to consider is the characterization of its set of symmetric extensions. This problem is equivalent to the study of the partial isometric extensions of a fixed…

Functional Analysis · Mathematics 2014-03-20 R. T. W. Martin

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

Computational Geometry · Computer Science 2019-08-07 Michael G. Dobbins , Andreas Holmsen , Tillmann Miltzow

A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Stefano Crespi Reghizzi , Pierluigi San Pietro

Hyperproperties are a modern specification paradigm that extends trace properties to express properties of sets of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and…

Logic in Computer Science · Computer Science 2021-04-28 Laura Bozzelli , Adriano Peron , Cesar Sanchez

We introduce the notion of "functional extension" of a set X, by means of two natural algebraic properties of the operator * on unary functions. We study the connections with ultrapowers of structures with universe X, and we give a simple…

Logic · Mathematics 2017-12-19 Marco Forti

This note deals with a problem of the probabilistic Ramsey theory in functional analysis. Given a linear operator $T$ on a Hilbert space with an orthogonal basis, we define the isomorphic structure $\Sigma(T)$ as the family of all subsets…

Functional Analysis · Mathematics 2016-12-23 Roman Vershynin

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Logic · Mathematics 2010-03-16 Fredrik Engström

We prove that for each multiplicative subgroup $A$ of finite index in $\mathbb{Q}^+$, the set of integers $a$ with $a, a+1 \in A$ is an IP-set. This generalizes a theorem of Hildebrand concerning completely multiplicative functions taking…

Number Theory · Mathematics 2019-05-29 Carsten Dietzel