query: Algorithm to decide whether a proposition is constructively provable
positive_passages.docid: 141952
positive_passages.text: Is there a decision procedure for intuitionistic propositional logic?
negative_passages.docid: 104871
negative_passages.text: Direct cut-elimination for natural deduction.
negative_passages.docid: 14849
negative_passages.text: Decidability of a predicate.
negative_passages.docid: 148028
negative_passages.text: Are there statements that are undecidable but not provably undecidable
negative_passages.docid: 139992
negative_passages.text: Is power-associativity finitely axiomatizable?
negative_passages.docid: 9158
negative_passages.text: Proving that a propositional theory of any cardinality has an independent set of axioms
negative_passages.docid: 157490
negative_passages.text: Statements equivalent to the Axiom of Choice
negative_passages.docid: 51863
negative_passages.text: Logical Conditional Truth Table Rationale
negative_passages.docid: 103653
negative_passages.text: Interpretations and models in propositional logic
negative_passages.docid: 45481
negative_passages.text: Prove or disprove validity: $(\forall x \exists y (P(x) \supset Q(y))) \supset(\exists y \forall x (P (x) \supset Q(y)))$
negative_passages.docid: 126713
negative_passages.text: Strong induction and vacuous truth
negative_passages.docid: 31389
negative_passages.text: consistency of ZF\{Power Set axiom}
negative_passages.docid: 141496
negative_passages.text: Could someone make the proof into a hinted exercise?
negative_passages.docid: 133617
negative_passages.text: Relatively prime property verification
negative_passages.docid: 134319
negative_passages.text: When induction proofs need a choice function
negative_passages.docid: 29110
negative_passages.text: Propositional Intuitionistic Logic Question
negative_passages.docid: 56191
negative_passages.text: How to demystify the axioms of propositional logic?