What is the largest complexity class that a non-Turing complete proof assitant, like Coq, can achieve?
57089
Class of functions computable by Coq
72213
Can a $N-1$ rectifiable set be partitioned into countably many connected pieces?
154324
preservation of completeness under homeomorphism
133617
Relatively prime property verification
62687
Proving Cardinality of Cosets in Abstract Algebra
35115
Questions on how to prove that a set of connectives is NOT functionally complete
4383
Finitely generated monoids - how to show that there is not first order set axiomatizing them.
72371
Proof of Strong Induction Using Well-Ordering Principle
62958
Maximize $\mathrm{tr}(Q^TCQ)$ subject to $Q^TQ=I$
97187
In what formal system is Godel's Incompleteness Theorem (or similar statements of undecidability) proven?
69838
Does a countably infinite power set exist?
70064
Computational complexity of RSA
32910
Completion and algebraic closure commutable
32009
Prove $\;\big((p\rightarrow q) \lor (p \rightarrow r)\big) \rightarrow (q\lor r)\equiv p \lor q \lor r$ without use of a truth table.
92249
Every finite set contains its supremum: proof improvement.
82947
Undecidable cardinality
89749
Example of a not recursively enumerable set $A \subseteq \mathbb{N}$