Algebraic properties of the first-order part of a problem
From MaRDI portal
Publication:6040614
DOI10.1016/j.apal.2023.103270arXiv2203.16298OpenAlexW4365511481MaRDI QIDQ6040614
Giovanni Soldà, Manlio Valenti
Publication date: 19 May 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.16298
Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Computation over the reals, computable analysis (03D78) Hierarchies of computability and definability (03D55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- The weakness of being cohesive, thin or free in reverse mathematics
- A topological view on algebraic computation models
- On the uniform computational content of computability theory
- Completion of choice
- Probabilistic computability and choice
- On uniform relationships between combinatorial problems
- Turing Computability
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- On notions of computability-theoretic reduction between Π21 principles
- On the algebraic structure of Weihrauch degrees
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
- Monte Carlo Computability
- A note on the diamond operator
- THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- Weihrauch Complexity in Computable Analysis
- Ramsey’s theorem and products in the Weihrauch degrees
- Leaf management
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- On the topological aspects of the theory of represented spaces
- SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE
This page was built for publication: Algebraic properties of the first-order part of a problem
