English
Related papers

Related papers: Isomorphism property in nonstandard extensions of …

200 papers

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

Intelligent systems must deploy internal representations that are simultaneously structured -- to support broad generalization -- and selective -- to preserve input identity. We expose a fundamental limit on this tradeoff. For any model…

The character ring \CGL of covariant irreducible tensor representations of the general linear group admits a Hopf algebra structure isomorphic to the Hopf algebra \Sym$ of symmetric functions. Here we study the character rings \CO and \CSp…

Representation Theory · Mathematics 2012-07-27 Bertfried Fauser , Peter D. Jarvis , Ronald C. King

Hopf insulator is a representative class of three-dimensional topological insulators beyond the standard topological classification methods based on K-theory. In this letter, we discover the metallic counterpart of the Hopf insulator in the…

Mesoscale and Nanoscale Physics · Physics 2025-04-25 Seik Pak , Cheol Hun Yeom , Sonu Verma , Moon Jip Park

A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…

Logic · Mathematics 2008-02-03 Bernhard Herwig

Let $R$ be a polynomial ring over a field $k$ with irrelevant ideal $\frak m$ and dimension $d$. Let $I$ be a homogeneous ideal in $R$. We study the asymptotic behavior of the length of the modules $H^{i}_{\frak m}(R/I^n)$ for $n\gg 0$. We…

Commutative Algebra · Mathematics 2017-10-10 Hailong Dao , Jonathan Montaño

We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.

Logic · Mathematics 2020-04-06 Clovis Hamel , Haim Horowitz , Saharon Shelah

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

We consider a superalgebra with a superinvolution or graded involution $\#$ over a field $F$ of characteristic zero and assume that it is a $PI$-algebra. In this paper, we present the proof of a version of the celebrated hook theorem…

Rings and Algebras · Mathematics 2025-01-06 Irina Sviridova , Renata A. Silva

Any finite set of training data is consistent with an infinite number of hypothetical algorithms that could have generated it. Studies have shown that when human children learn language, they consistently favor hypotheses based on…

Computation and Language · Computer Science 2025-11-06 Brian DuSell , Ryan Cotterell

In a 2005 paper, Casacuberta, Scevenels and Smith construct a homotopy idempotent functor $E$ on the category of simplicial sets with the property that whether it can be expressed as localization with respect to a map $f$ is independent of…

Algebraic Topology · Mathematics 2024-05-29 J. Daniel Christensen

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

General Mathematics · Mathematics 2025-10-23 Joaquim Reizi Barreto

Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…

Formal Languages and Automata Theory · Computer Science 2015-05-08 Lawrence C. Paulson

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

Logic in Computer Science · Computer Science 2020-05-29 Ciarán Dunne , J. B. Wells , Fairouz Kamareddine

A homeomorphically irreducible spanning tree (HIST) is a spanning tree with no degree-2 vertices, serving as a structurally minimal backbone of a graph. While the existence of HISTs has been widely studied from a structural perspective, the…

Computational Complexity · Computer Science 2025-10-07 Tesshu Hanaka , Hironori Kiya , Hirotaka Ono

Target similarity tuning (TST) is a method of selecting relevant examples in natural language (NL) to code generation through large language models (LLMs) to improve performance. Its goal is to adapt a sentence embedding model to have the…

Artificial Intelligence · Computer Science 2023-10-31 Anirudh Khatry , Sumit Gulwani , Priyanshu Gupta , Vu Le , Ananya Singha , Mukul Singh , Gust Verbruggen

We prove that groups that are mod-p-homology equivalent are isomorphic modulo any term of their derived p-series, in precise analogy to Stallings' 1963 result for the lower-central p-series. Similarly spaces that are mod-p-homology…

Geometric Topology · Mathematics 2008-11-26 Tim D. Cochran , Shelly Harvey

We extend the definition of generalized parity $P$, charge-conjugation $C$ and time-reversal $T$ operators to nondiagonalizable pseudo-Hermitian Hamiltonians, and we use these generalized operators to describe the full set of symmetries of…

Quantum Physics · Physics 2009-11-10 A. Blasi , G. Scolarici , L. Solombrino

A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…

Logic · Mathematics 2019-10-01 Fausto Barbero

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

Combinatorics · Mathematics 2019-08-20 Frank a Campo