Open Proof Obligations
This page includes open questions and theorem statements from draft and registered submissions, plus lemma statements from registered submissions, when they are not yet supported by a grounded chain of archived proofs. To keep work in progress from crowding out registered results, at most one statement is shown from each non-registered submission.
-
ope×
P versus NP
1 open statement
-
The conjectured separation of P and NP, left as an open question.
-
-
1 open statement
-
Theorem 3.2. A function between types is rational if and only if it is the denotation of some rational term.
-
-
1 open statement
-
A black-box word-RAM program achieves the refined crossing bound within near-linear time, with constant success probability.
-
-
1 open statement
-
Gaifman's normal-form theorem. There is a uniform transformation of every first-order formula over into an equivalent Gaifman normal form. For an input of quantifier rank with free variables, its common radius is at most , each basic local sentence has at most witnesses, and a sentence is translated using basic local sentences only. Equivalence holds in every finite -structure.
-
-
1 of 2 statements open
-
Two false claims admit derivations from each other and from themselves. None has a proof grounded in the background axioms. This additional control tests the least-fixed-point interpretation of the proof network.
-
-
1 open statement
-
Descent from stage 300 to stage 290.
-
- No proof obligations match.