AI Chat AI Image Generator AI Video AI Music Generator

Cantor-Bendixson ranks of countable SFTs

03/02/2018

∙

by Ilkka Törmä, et al.

∙

∙

We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form λ + 3, where λ is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.

research

∙ 02/06/2019

On Quasi Ordinal Diagram Systems

The purposes of this note are the following two; we first generalize Oka...

0 Mitsuhiro Okada, et al. ∙

research

∙ 10/15/2017

The Complete Extensions do not form a Complete Semilattice

In his seminal paper that inaugurated abstract argumentation, Dung prove...

0 Anthony P. Young, et al. ∙

research

∙ 11/09/2017

On First-order Cons-free Term Rewriting and PTIME

In this paper, we prove that (first-order) cons-free term rewriting with...

0 Cynthia Kop, et al. ∙

research

∙ 05/30/2023

New Remarks on Yablo Like Structures

This is a sequel to the author's "Truth and Knowledge", College Publicat...

0 Karl Schlechta, et al. ∙

research

∙ 05/07/2020

The Zhou Ordinal of Labelled Markov Processes over Separable Spaces

There exist two notions of equivalence of behavior between states of a L...

0 Martín Santiago Moroni, et al. ∙

research

∙ 01/31/2020

A direct proof of APN-ness of the Kasami functions

Using recent results on solving the equation X^2^k+1+X+a=0 over a finite...

0 Claude Carlet, et al. ∙

research

∙ 07/27/2022

An optimal generalization of Alon and Füredi's covering result

Given an n-cube 𝒬^n := {0,1}^n in ℝ^n, the k-th layer 𝒬^n_k of 𝒬^n denot...

0 Arijit Ghosh, et al. ∙