DeepAI AI Chat

On Quasi Ordinal Diagram Systems

02/06/2019

∙

by Mitsuhiro Okada, et al.

∙

Keio University

∙

∙

The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we discuss possible use of such strong ordinal notation systems for the purpose of a typical traditional termination proof method for term rewriting systems, especially for second-order (pattern-matching-based) rewriting systems including a rewrite-theoretic version of Buchholz's hydra game.

Mitsuhiro Okada
3 publications
Yuta Takahashi
3 publications

page 1

page 2

page 3

page 4

∙ 01/25/2023

Set-Theoretic and Type-Theoretic Ordinals Coincide

In constructive set theory, an ordinal is a hereditarily transitive set....

0 Tom de Jong, et al. ∙

∙ 03/02/2018

Cantor-Bendixson ranks of countable SFTs

We show that the possible Cantor-Bendixson ranks of countable SFTs are e...

0 Ilkka Törmä, et al. ∙

∙ 01/09/2022

First-order separation over countable ordinals

We show that the existence of a first-order formula separating two monad...

0 Thomas Colcombet, et al. ∙

∙ 04/30/2019

Convergence rates for ordinal embedding

We prove optimal bounds for the convergence rate of ordinal embedding (a...

0 Jordan S. Ellenberg, et al. ∙

∙ 11/28/2017

Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version

We consider ordinal approximation algorithms for a broad class of utilit...

0 Ben Abramowitz, et al. ∙

∙ 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. ∙

∙ 07/13/2023

Towards Ordinal Data Science

Order is one of the main instruments to measure the relationship between...

0 Gerd Stumme, et al. ∙