English
Related papers

Related papers: On highly equivalent non-isomorphic countable mode…

200 papers

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

General Topology · Mathematics 2020-08-05 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignments of sequences without mutual correlations are found to…

Biological Physics · Physics 2009-09-25 Dirk Drasdo , Terence Hwa , Michael Lassig

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

Rings and Algebras · Mathematics 2014-02-26 Hung Le Pham

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

Logic · Mathematics 2018-11-20 Gianluca Paolini , Saharon Shelah

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…

Logic · Mathematics 2007-05-23 Jaroslav Nešetřil , Saharon Shelah

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences…

Logic · Mathematics 2016-11-16 Douglas Ulrich , Richard Rast , Michael C. Laskowski

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Logic · Mathematics 2017-10-18 Nathanael Ackerman , Cameron Freer , Rehana Patel

Modulo the existence of large cardinals, there is a model of set theory in which for some set $B$ of regular cardinals, the sequence $\langle \text{pcf}^\alpha(B): \alpha \in \text{Ord} \rangle$ is strictly increasing. The result answers a…

Logic · Mathematics 2023-04-06 Mohammad Golshani

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Logic · Mathematics 2010-06-22 Shahram Mohsenipour

We construct examples of number fields which are not isomorphic but for which their idele class groups are isomorphic. We also construct examples of projective algebraic curves which are not isomorphic but for which their Jacobian varieties…

Number Theory · Mathematics 2014-09-11 Dipendra Prasad

We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$, there exists a full satisfaction class $S_A \subset M^2$ such that $A$ is definable in $(M,S_A)$ without parametres. It…

Logic · Mathematics 2021-04-21 Bartosz Wcisło

The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree…

Logic · Mathematics 2007-05-23 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

We show that if $\gamma \in \omega \cup \{\aleph_{0}\}$ and $\mathcal{A}$ is a counterexample to the analytic Vaught conjecture having exactly $\gamma$ many models of Scott rank $\omega_{1}$, then there exists a club $C \subseteq…

Logic · Mathematics 2019-03-26 Paul Larson , Saharon Shelah

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

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

For each type of number, structures that differ by arbitrary scaling factors and are isomorphic to one another are described. The scaling of number values in one structure, relative to the values in another structure, must be compensated…

Rings and Algebras · Mathematics 2013-12-06 Paul Benioff

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

Logic · Mathematics 2008-03-25 Wesley Calvert , Sergey S. Goncharov , Julia F. Knight

We study countable compact spaces as potential attractors of iterated function systems. We give an example of a convergent sequence in the real line which is not an IFS-attractor and for each countable ordinal $\delta$ we show that a…

Dynamical Systems · Mathematics 2013-07-29 Magdalena Nowak

Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…

Logic · Mathematics 2018-04-03 David M. Cerna , Anela Lolic

We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .

Logic · Mathematics 2008-02-03 Saharon Shelah