Imagen de Portada

On the computational properties of ambivalent sets and functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Normann, Dag, Sanders, Sam
Formato:	Preprint
Publicado:	2026
Materias:	Logic 03B30, 03F35 F.4.1; F.1.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On some computational properties of open sets
por: Normann, Dag, et al.
Publicado: (2024)

Exploring the abyss in Kleene's computability theory
por: Sanders, Sam
Publicado: (2023)

The uncountability of the reals and the Axiom of Choice
por: Normann, Dag, et al.
Publicado: (2026)

On two recent extensions of the Big Five of Reverse Mathematics
por: Normann, Dag, et al.
Publicado: (2024)

On sequential theorems in Reverse Mathematics
por: Normann, Dag, et al.
Publicado: (2024)

On the computational properties of basic mathematical notions
por: Normann, Dag, et al.
Publicado: (2022)

A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)

Weihrauch problems as containers
por: Pradic, Cécilia, et al.
Publicado: (2025)

Undecidability in Relevant Logic
por: Knudstorp, Søren Brinck
Publicado: (2026)

Thoughts on sub-Turing interactive computability
por: Japaridze, Giorgi
Publicado: (2024)

A foundational characterization of Hoare Logic
por: Leivant, Daniel
Publicado: (2026)

Loops, Inverse Limits and Non-Determinism
por: Brattka, Vasco
Publicado: (2025)

A note on continuous functions on metric spaces
por: Sanders, Sam
Publicado: (2024)

The Directed Van Kampen Theorem in Lean
por: Basold, Henning, et al.
Publicado: (2023)

Linear Orders in Presburger Arithmetic
por: Pakhomov, Fedor, et al.
Publicado: (2022)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
por: Vodrazka, Daniel
Publicado: (2025)

Glivenko's theorems from an ecumenical perspective
por: Pereira, Luiz Carlos, et al.
Publicado: (2026)

The reverse mathematics of the pigeonhole hierarchy
por: Houérou, Quentin Le, et al.
Publicado: (2024)

On countability and representations
por: Sanders, Sam
Publicado: (2026)

Coding is hard
por: Sanders, Sam
Publicado: (2024)

Approximation theorems throughout Reverse Mathematics
por: Sanders, Sam
Publicado: (2023)

Connecting real and hyperarithmetical analysis
por: Sanders, Sam
Publicado: (2024)

Big in Reverse Mathematics: measure and category
por: Sanders, Sam
Publicado: (2023)

Proof Compression via Subatomic Logic and Guarded Substitutions
por: Barrett, Victoria, et al.
Publicado: (2025)

A propositional cirquent calculus for computability logic
por: Japaridze, Giorgi
Publicado: (2024)

Serial Properties, Selector Proofs, and the Provability of Consistency
por: Artemov, Sergei
Publicado: (2024)

Non-Compact Proofs
por: Artemov, Sergei
Publicado: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
por: Artemov, Sergei
Publicado: (2025)

Internal Effectful Forcing in System T
por: Escardo, Martin H., et al.
Publicado: (2025)

Remarks on Primitive Regulation
por: Rosko, Milan
Publicado: (2026)

Y is a least fixed point combinator
por: Helfer, Joseph
Publicado: (2025)

ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
por: Wang, Shuai
Publicado: (2024)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
por: Barroso-Nascimento, Victor, et al.
Publicado: (2025)

Cut elimination for propositional cyclic proof systems with fixed-point operators
por: Hori, Hiromasa, et al.
Publicado: (2023)

Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing
por: Moore, Hayden, et al.
Publicado: (2025)

Effective bases and notions of effective second countability in computable analysis
por: Brattka, Vasco, et al.
Publicado: (2025)

Universal Gluing and Contextual Choice: Categorical Logic and the Foundations of Analytic Approximation
por: Santacana, Andreu Ballus
Publicado: (2025)

On the Realizability of Prime Conjectures in Heyting Arithmetic
por: Rosko, Milan
Publicado: (2025)

Consistent ultrafinitist logic
por: Gajda, Michał J.
Publicado: (2021)

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)