A Note on the Decidability of the Necessity of Axioms

preprint2014arXivOpen access

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 TT, one looks for minimal subsystems of TT that allow deriving ϕϕ. In particular, one asks whether, given some system T+ψT+ψ, TT alone suffices to prove ϕϕ. We show that this problem is undecidable unless T+¬ψT+\negψ is decidable.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.