ProbXiv
Explorersign in
Problem archiveProblem record

Statement

(2) the matrix principle AB = U \supset BA = I, for which the answer is at most P, but we conjecture lower down. Then one way to formalise our motivating question is “What is the least such theory which proves the question.” There are quantified propositional proof systems associated with each complex- ity class (∗), and we explain a general method of translating the ΣB 1 theories of each theory into polynomial size families of proofs in the associated theory.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.