Image de couverture de livre

Problems with fixpoints of polynomials of polynomials

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pradic, Cécilia, Price, Ian
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science Logic 03D30, 03D78, 03D55, 03B70, 03F60, 18D99
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

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

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)

Computable Approximations of Semicomputable Graphs
par: Čačić, Vedran, et autres
Publié: (2024)

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

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
par: Harrington, Leo A., et autres
Publié: (2025)

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)

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

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

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

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

Induction on Dilators and Bachmann-Howard Fixed Points
par: Aguilera, Juan P., et autres
Publié: (2024)

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

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)

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

The weakness of finding descending sequences in ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2024)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
par: Gerdes, Peter
Publié: (2023)

Fundamental sequences based on localization
par: Wilken, Gunnar
Publié: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
par: Wilken, Gunnar
Publié: (2025)

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

Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
par: Lutz, Patrick, et autres
Publié: (2023)

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

The reverse mathematics of the pigeonhole hierarchy
par: Houérou, Quentin Le, et autres
Publié: (2024)

Refutability as Recursive as Provability
par: Cattabriga, Paola
Publié: (2024)

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

Axiom Beta Implies Elementary Transfinite Recursion
par: Frittaion, Emanuele, et autres
Publié: (2026)

An equiconsistency proof for $\mathrm{CZF} + V = L$
par: Wang, Shuwei
Publié: (2026)

A Minimal Substitution Basis for the Kalmár Elementary Functions
par: Prunescu, Mihai, et autres
Publié: (2025)

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

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
par: Song, Sirun, et autres
Publié: (2025)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2025)

Analysis of HOD for Admissible Structures
par: Kruschewski, Jan, et autres
Publié: (2025)

A 2-categorical approach to the semantics of dependent type theory with computation axioms
par: Spadetto, Matteo
Publié: (2025)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
par: Huttegger, Simon M., et autres
Publié: (2024)