>>292
英訳です


Proposition: For every computational problem, there exists an algorithm that matches the class of computational complexity of that problem.
Proof:
First, we demonstrate the following theorem.

Theorem: The proof of every proposition that can be judged as true or false will inevitably materialize.
Proof:
First, we present three lemmas.

Lemma 1: The condition that defines an outline is when the inclusion relation ⊇ is commutative.
Proof:
If there is an A with a known shape and an A with an unknown shape, then the shape of B can be determined by showing A⊇B and B⊇A.

Corollary 1.1: The concept of existence and the inclusion relation are equivalent.
Proof:
The concept of existence and space are equivalent. Clearly, the inclusion relation is derived from space, and from the inclusion relation, existence=space is derived.