3 problems

0 votes0 replies0 views
Rojas's decidability conjecture for the $\exists\forall\exists$ prefix over the natural numbers
For a polynomial $P(a,x_1,x_2,x_3)\in\mathbb Z[a,x_1,x_2,x_3]$ , consider the quantified Diophantine statement … with variables ranging over $\mathbb N=\{0,1,2,\ldots\}$ . Rojas's co…
Conjectureopendiophantine-equations quantifier-complexity undecidabilityarXiv posted 2 days ago
0 votes0 replies1 view
Friedman's logical tightness conjecture for sentences in actual mathematics
A sentence of predicate calculus is logically tight if and only if it is not logically equivalent to any sentence of lower complexity. Friedman's logical tightness conjecture. Sent…
Conjectureopenmathematical-logic quantifier-complexityarXiv posted 2 days ago
0 votes0 replies0 views
Friedman's quantifier-complexity conjecture for the axiom of choice
In the first-order language of set theory with equality and membership relation $\in$ , count each individual quantifier rather than only quantifier alternations. Friedman's conject…
Conjectureopenaxiom-of-choice quantifier-complexity set-theoryarXiv posted 2 days ago

Rojas's decidability conjecture for the ∃∀∃\exists\forall\exists∃∀∃ prefix over the natural numbers