Abstract
A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement in some axiomatic system , one looks for minimal subsystems of that allow deriving . In particular, one asks whether, given some system , alone suffices to prove . We show that this problem is undecidable unless is decidable.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.