show/hide this revision's text 4 edited title

Is there an "udecided" undecided" assertion of which a proof that it's not undecidable is known?

show/hide this revision's text 3 added 16 characters in body

Just a curiosity:

Is there an assertion of which a proof (formalizable, say, in ZFC) is not known but a proof that it's not undecidable (in ZFC) is known?

Edit: after the comments, I think the actual question was

Is there an ("interesting") assertion of which neither a proof (formalizable, say, in ZFC) of it or its negation is known but a proof that it's not undecidable (in ZFC) is known?

show/hide this revision's text 2 added 234 characters in body; edited title

Is there an "udecided" assertion of which a proof is not known but a proof that it's not undecidable is known?

Just a curiosity:

Is there an assertion of which a proof (formalizable, say, in ZFC) is not known but a proof that it's not undecidable (in ZFC) is known?

Edit: after the comments, I think the actual question was

Is there an assertion of which neither a proof (formalizable, say, in ZFC) of it or its negation is known but a proof that it's not undecidable (in ZFC) is known?

show/hide this revision's text 1