Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Reverse mathematics and Weihrauch analysis motivated by finite complexity theory

From MaRDI portal
Publication:5037213
Jump to:navigation, search

DOI10.3233/COM-210310OpenAlexW3172444865MaRDI QIDQ5037213

Jeffry L. Hirst, Zach Bement, Asuka Wallace

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.01719

zbMATH Keywords

ACAreverse mathematicsisomorphic subgraph\(\Pi_1^1\) comprehensionLPOweihrauch


Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)


Related Items

The complexity of finding supergraphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Reverse mathematics and uniformity in proofs without excluded middle
  • Infinite versions of some problems from finite complexity theory
  • Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
  • Using Ramsey's theorem once
  • Classical consequences of continuous choice principles from intuitionistic analysis
  • On uniform relationships between combinatorial problems
  • Leaf management
  • Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
  • ∏ 0 1 Classes and Degrees of Theories
  • SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5037213&oldid=19513269"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki