English
Related papers

Related papers: Isomorphism property in nonstandard extensions of …

200 papers

Given two relations containing multiple measurements - possibly with uncertainties - our objective is to find which sets of attributes from the first have a corresponding set on the second, using exclusively a sample of the data. This…

Databases · Computer Science 2022-07-20 Alejandro Alvarez-Ayllon , Manuel Palomo-Duarte , Juan-Manuel Dodero

In this paper, we introduce a natural class of multigraphs called hierarchical-scale-free (HSF) multigraphs, and consider constant-time testability on the class. We show that a very wide subclass, specifically, that in which the power-law…

Data Structures and Algorithms · Computer Science 2015-07-24 Hiro Ito

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…

Group Theory · Mathematics 2013-03-21 Karl Lorensen

In this paper we study the interactions between so-called fractional relaxations of the integer programs (IPs) which encode homomorphism and isomorphism of relational structures. We give a combinatorial characterization of a certain natural…

Data Structures and Algorithms · Computer Science 2024-01-31 Libor Barto , Silvia Butti , Víctor Dalmau

We study the properties of the language of Stratified Sets (first-order logic with $\in$ and a stratification condition) as used in TST, TZT, and (with stratifiability instead of stratification) in Quine's NF. We find that the syntax forms…

Logic in Computer Science · Computer Science 2023-06-22 Murdoch J. Gabbay

In this work, we introduce a PT-symmetric infinite-dimensional representation of the Uz(sl(2,R)) Hopf algebra, and we analyse a multiparametric family of Hamiltonians constructed from such representation of the generators of this…

Quantum Physics · Physics 2025-12-01 Ángel Ballesteros , Romina Ramírez , Marta Reboiro

Intrinsically gapless symmetry protected topological phases (igSPT) are gapless systems with SPT edge states with properties that could not arise in a gapped system with the same symmetry and dimensionality. igSPT states arise from gapless…

Strongly Correlated Electrons · Physics 2024-03-01 Rui Wen , Andrew C. Potter

Let $\mathbf D$ be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On $\BZ\mathbf D$ we define a product and a coproduct, together with an internal product, that is,…

Representation Theory · Mathematics 2011-02-19 Claudia Malvenuto , Christophe Reutenauer

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…

Logic · Mathematics 2016-09-14 Joel David Hamkins , Cole Leahy

The breakdown of the bulk-boundary correspondence in non-Hermitian (NH) topological systems is an open, controversial issue. In this paper, to resolve this issue, we ask the following question: Can a (global) topological invariant…

Mesoscale and Nanoscale Physics · Physics 2020-12-30 Xiao-Ran Wang , Cui-Xian Guo , Su-Peng Kou

A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…

Functional Analysis · Mathematics 2026-04-01 Behnam Esmayli , Pekka Koskela , Khanh Nguyen

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

Lemmatization of standard languages is concerned with (i) abstracting over morphological differences and (ii) resolving token-lemma ambiguities of inflected words in order to map them to a dictionary headword. In the present paper we aim to…

Computation and Language · Computer Science 2019-03-19 Enrique Manjavacas , Ákos Kádár , Mike Kestemont

The language of homotopy type theory has proved to be appropriate as an internal language for various higher toposes, for example with Synthetic Algebraic Geometry for the Zariski topos. In this paper we apply such techniques to the higher…

Logic · Mathematics 2024-12-05 Felix Cherubini , Thierry Coquand , Freek Geerligs , Hugo Moeneclaey

In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…

Logic · Mathematics 2017-09-25 Joel David Hamkins , Jonas Reitz

We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…

Category Theory · Mathematics 2010-04-23 Michael A. Shulman

In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and nonmonotonicity of…

Artificial Intelligence · Computer Science 2023-07-21 Michael Bartholomew , Joohyung Lee

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…

Logic · Mathematics 2020-02-06 Alfredo Roque Freire