English
Related papers

Related papers: Cantor-Bendixson ranks of countable SFTs

200 papers

We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…

Programming Languages · Computer Science 2017-01-11 James Laird

We give an exact value of the rank of an $\mathcal{F}$-Fubini sum of filters for the case where $\mathcal{F}$ is a Borel filter of rank $1$. We also consider $\mathcal{F}$-limits of filters $\mathcal{F}_i$, which are of the form…

Logic · Mathematics 2014-10-03 Adam Kwela , Ireneusz Recław

It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…

Logic in Computer Science · Computer Science 2007-05-23 Mateusz Zakrzewski

We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We…

Group Theory · Mathematics 2019-02-20 Robert Bieri , Yves de Cornulier , Luc Guyot , Ralph Strebel

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…

Logic in Computer Science · Computer Science 2019-05-17 Achim Blumensath , Felix Wolf

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

Logic · Mathematics 2017-02-28 Paolo Lipparini

The purpose of this note is twofold. In the first part we observe that two finitely generated non-amenable groups are quasi-isometric if and only if they admit topologically orbit equivalent Cantor minimal actions. In particular, free…

Dynamical Systems · Mathematics 2017-06-21 Kostya Medynets , Roman Sauer , Andreas Thom

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 determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…

Logic · Mathematics 2017-01-31 William Balderrama , Philipp Hieronymi

For any Polish space $X$ it is well-known that the Cantor-Bendixson rank provides a co-analytic rank on $F_{\aleph_0}(X)$ if and only if $X$ is a $\sigma$-compact. In the case of $\omega^\omega$ one may recover a co-analytic rank on…

Logic · Mathematics 2018-06-11 Vibeke Quorning

In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…

Mathematical Physics · Physics 2025-05-20 Joseph Ben Geloun , Arnauld Solente

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

Logic · Mathematics 2017-02-10 Takayuki Kihara

We consider the class of compact countable subsets of the real numbers $\mathbb{R}$. By using an appropriate partition, up to homeomorphism, of this class we give a detailed proof of a result shown by S. Mazurkiewicz and W. Sierpinski…

General Topology · Mathematics 2018-03-29 Borys Álvarez-Samaniego , Andrés Merino

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

Logic · Mathematics 2024-12-11 Thierry Coquand , Henri Lombardi , Stefan Neuwirth

In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…

Logic in Computer Science · Computer Science 2024-11-19 Valentin Maestracci , Paolo Pistone

In this paper we show that if X is an infinite compactum cleavable over an ordinal, then X must be homeomorphic to an ordinal. X must also therefore be a LOTS. This answers two fundamental questions in the area of cleavability. We also…

General Topology · Mathematics 2012-03-29 Shari S. Levine

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.

Algebraic Geometry · Mathematics 2011-07-13 Stéphane Ballet , Jean Chaumine , Julia Pieltant , Robert Rolland

We give a heuristic for the number of reduced rationals on Cantor's middle thirds set, with a fixed bound on the denominator. We also describe extensive numerical computations supporting this heuristic.

Number Theory · Mathematics 2019-09-04 Alexander Rahm , Noam Solomon , Tara Trauthwein , Barak Weiss

This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble…

Group Theory · Mathematics 2011-02-16 Miklos Abert , Andrei Jaikin-Zapirain , Nikolay Nikolov
‹ Prev 1 3 4 5 6 7 10 Next ›