Quantcast
Channel: Decidability of decidability - MathOverflow
Browsing all 3 articles
Browse latest View live

Answer by Joel David Hamkins for Decidability of decidability

$\newcommand\Con{\text{Con}}\newcommand\Dec{\text{Dec}}$Let $F$ be the formal system in which the proofs are to be carriedout, when it comes to your formal assertions of the form$\Dec(\varphi)$. So we...

View Article


Answer by Fedya for Decidability of decidability

This answer is from the point of view of algorithmic decidability; I'm not sure how much of it carries over to other logical systems. So let's suppose our statements are strings in a finite alphabet...

View Article


Decidability of decidability

The questions I'm going to ask are non formal because they concern decidability of decidability, and I couldn't find any references on that after some quick searches. I hope that this thread is still...

View Article
Browsing all 3 articles
Browse latest View live


Latest Images