Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Loading…

Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products

current community
- MathOverflow
  
  help chat
- MathOverflow Meta
your communities

Sign up or log in to customize your list.

more stack exchange communities
company blog
Log in
Sign up

1. Home
2. Questions
3. Tags
5. Users
6. Unanswered

All Questions

Ask Question

1 question

Newest Active Bountied Unanswered

Bountied 0
Unanswered
Frequent
Score
Unanswered (my tags)

Filter by

No answers

No accepted answer

Has bounty

Sorted by

Newest

Recent activity

Highest score

Most frequent

Bounty ending soon

Tagged with

My watched tags

The following tags:

17 votes

7 answers

2k views

Non-constructive proofs of decidability?

Are there examples of sets of natural numbers that are proven to be decidable but by non-constructive proofs only?

lo.logic
big-list
computability-theory
peano-arithmetic
decidability

Community wiki

3 revs
Hans Stricker

Featured on Meta
Stack Overflow Jobs is expanding to more countries
The Winter 2024 Community Asks Sprint has been moved to to March 2025 (and...

Related Tags

computability-theory × 1

decidability × 1

Recently active big-list lo.logic theories-of-arithmetic questions feed

Subscribe to RSS

Recently active big-list lo.logic theories-of-arithmetic questions feed

To subscribe to this RSS feed, copy and paste this URL into your RSS reader.

MathOverflow

Tour
Help
Chat
Contact
Feedback

Company

Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Cookie Policy

Blog
Facebook
Twitter
LinkedIn
Instagram