Image de couverture de livre

The weakness of finding descending sequences in ill-founded linear orders

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goh, Jun Le, Pauly, Arno, Valenti, Manlio
Format:	Preprint
Publié:	2024
Sujets:	Logic Logic in Computer Science Combinatorics 03D30 03D78 06A75
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Finding descending sequences through ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2020)

Minimal covers in the Weihrauch degrees
par: Lempp, Steffen, et autres
Publié: (2023)

A jump operator on the Weihrauch degrees
par: Andrews, Uri, et autres
Publié: (2024)

Sequential discontinuity and first-order problems
par: Pauly, Arno, et autres
Publié: (2024)

Chains and antichains in the Weihrauch lattice
par: Lempp, Steffen, et autres
Publié: (2024)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
par: Cipriani, Vittorio, et autres
Publié: (2022)

Computably discrete represented spaces
par: Neumann, Eike, et autres
Publié: (2025)

Weihrauch reducibility between Ramsey-type theorems and well-ordering principles at the level of $Σ^0_2$-induction: A pilot study
par: Carlucci, Lorenzo, et autres
Publié: (2025)

More on the indivisibility of $\mathbb{Q}$
par: Pauly, Arno
Publié: (2024)

The tree pigeonhole principle in the Weihrauch degrees
par: Dzhafarov, Damir, et autres
Publié: (2023)

Countable Ordered Groups and Weihrauch Reducibility
par: Li, Ang
Publié: (2024)

Effective weak convergence and tightness of measures in computable Polish spaces
par: Rojas, Diego A.
Publié: (2024)

The computational content of multidimensional discontinuity
par: Hölzl, Rupert, et autres
Publié: (2024)

The Weihrauch degree of finding Nash equilibria in multiplayer games
par: Crook, Tonicha, et autres
Publié: (2021)

Problems with fixpoints of polynomials of polynomials
par: Pradic, Cécilia, et autres
Publié: (2026)

(Extra)ordinary equivalences with the ascending/descending sequence principle
par: Fiori-Carones, Marta, et autres
Publié: (2021)

Dense Chains, Antichains, and Universal Partial Orders Inside a Bounded Finite-One Degree
par: Cintioli, Patrizio
Publié: (2026)

Regainingly approximable numbers and sets
par: Hertling, Peter, et autres
Publié: (2023)

Embeddability of graphs and Weihrauch degrees
par: Cipriani, Vittorio, et autres
Publié: (2023)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
par: Hertling, Peter, et autres
Publié: (2025)

The Galvin-Prikry Theorem in the Weihrauch lattice
par: Marcone, Alberto, et autres
Publié: (2024)

Towards Better: A motivated introduction to better-quasi-orders
par: Pequignot, Yann
Publié: (2016)

New definitions in the theory of Type 1 computable topological spaces
par: Rauzy, Emmanuel
Publié: (2023)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
par: Rauzy, Emmanuel
Publié: (2023)

Weihrauch problems as containers
par: Pradic, Cécilia, et autres
Publié: (2025)

The equational theory of the Weihrauch lattice with multiplication
par: Neumann, Eike, et autres
Publié: (2024)

Computable Bases
par: Brattka, Vasco, et autres
Publié: (2025)

Evaluative presentations
par: McNicholl, Timothy H.
Publié: (2024)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
par: Samra, Jean Abou, et autres
Publié: (2026)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
par: Sorg, Christopher
Publié: (2026)

Benign approximations and non-speedability
par: Hölzl, Rupert, et autres
Publié: (2023)

Randomness versus superspeedability
par: Hölzl, Rupert, et autres
Publié: (2024)

Well-quasi-orders on finite trees and transfinite sequences
par: Chopra, Alakh Dhruv, et autres
Publié: (2026)

An effective version of the Stone duality
par: Bazhenov, Nikolay A., et autres
Publié: (2026)

Computable topological groups
par: Koh, Heer Tern, et autres
Publié: (2022)

On the computational properties of basic mathematical notions
par: Normann, Dag, et autres
Publié: (2022)

Intuitionism and computing with partial information
par: Ganchev, Hristo, et autres
Publié: (2026)

Effective bases and notions of effective second countability in computable analysis
par: Brattka, Vasco, et autres
Publié: (2025)

Subresiduated Nelson Algebras
par: Lubomirsky, Noemí, et autres
Publié: (2024)

Ramsey-like theorems for separable permutations
par: Houérou, Quentin Le, et autres
Publié: (2025)