English
Related papers

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

200 papers

I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial order.

Logic · Mathematics 2008-01-29 Victoria Gitman

For an infinite cardinal $\kappa$, let $ded\kappa$ denote the supremum of the number of Dedekind cuts in linear orders of size $\kappa$. It is known that $\kappa<ded\kappa\leq 2^{\kappa}$ for all $\kappa$ and that $ded\kappa<2^{\kappa}$ is…

Logic · Mathematics 2019-02-20 Artem Chernikov , Saharon Shelah

An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…

Logic · Mathematics 2023-10-19 Ruiyuan Chen

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…

Combinatorics · Mathematics 2021-01-22 Jacopo Borga , Raul Penaguiao

We investigate the problem of type isomorphisms in a programming language with higher-order references. We first recall the game-theoretic model of higher-order references by Abramsky, Honda and McCusker. Solving an open problem by Laurent,…

Logic in Computer Science · Computer Science 2011-12-15 Pierre Clairambault

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Group Theory · Mathematics 2018-07-04 Jillian D. McPhee , James D. Mitchell , Martyn Quick

We show that there is a compact topological space carrying a measure which is not a weak* limit of finitely supported measures but is in the sequential closure of the set of such measures. We construct compact spaces with measures of…

General Topology · Mathematics 2012-09-21 Piotr Borodulin-Nadzieja , Omar Selim

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…

Dynamical Systems · Mathematics 2022-02-14 Jana Hantáková , Samuel Roth , Ľubomír Snoha

If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.

Logic · Mathematics 2020-03-13 James H. Schmerl

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Number Theory · Mathematics 2022-08-17 Nicholas Dent , Caleb M. Shor

We provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…

Logic · Mathematics 2025-10-20 Peter Holy , Jonathan Schilhan

In this note, we study non-standard models of the rational numbers with countably many elements. These are ordered fields, and so it makes sense to complete them, using non-standard Cauchy sequences. The main result of this note shows that…

Logic · Mathematics 2007-05-23 Peter Laubenheimer , Thomas Schick , Ulrich Stuhler

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

Logic in Computer Science · Computer Science 2010-01-14 Dietrich Kuske , Jiamou Liu , Markus Lohrey

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…

Logic · Mathematics 2019-05-21 Taus Brock-Nannestad , Danko Ilik

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We consider unbounded curves without endpoints. Isomorphism is equivalence up to translation. Self-avoiding plane-filling curves cannot be periodic, but they can satisfy the local isomorphism property: We obtain a set $\Omega $ of coverings…

Combinatorics · Mathematics 2023-10-31 Francis Oger
‹ Prev 1 8 9 10 Next ›