Reverse mathematics and Weihrauch analysis motivated by finite complexity theory-Reference-Cited by-同舟云学术

Reverse mathematics and Weihrauch analysis motivated by finite complexity theory

Published:2021-10-07 Issue:4 Volume:10 Page:343-354
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

BeMent Zach¹,Hirst Jeffry²,Wallace Asuka³

Affiliation:

1. Department of Mathematical Sciences, Appalachian State University, Boone, NC 28608, USA. bementza@appstate.edu

2. Department of Mathematical Sciences, Appalachian State University, Boone, NC 28608, USA. hirstjl@appstate.edu

3. Department of Mathematical Sciences, Appalachian State University, Boone, NC 28608, USA. AsukaWallace@gmail.com

Abstract

We extend a study by Lempp and Hirst of infinite versions of some problems from finite complexity theory, using an intuitionistic version of reverse mathematics and techniques of Weihrauch analysis.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference12 articles.

1. Classical consequences of continuous choice principles from intuitionistic analysis;Dorais;Notre Dame J. Form. Log.,2014

2. On uniform relationships between combinatorial problems;Dorais;Trans. Amer. Math. Soc.,2016

3. Leaf management;Hirst;Computability,2020

4. Infinite versions of some problems from finite complexity theory;Hirst;Notre Dame J. Form. Log.,1996

5. Reverse mathematics and uniformity in proofs without excluded middle;Hirst;Notre Dame J. Form. Log.,2011

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Finding Supergraphs;Lecture Notes in Computer Science;2023