query: Is everything provable as true, false, or undecidable?
positive_passages.docid: 148028
positive_passages.text: Are there statements that are undecidable but not provably undecidable
negative_passages.docid: 6535
negative_passages.text: Proof of for-all / there-exists "negation"?
negative_passages.docid: 43700
negative_passages.text: Are proofs by contradiction really logical?
negative_passages.docid: 113957
negative_passages.text: Why is it possible to conclude everything from a false statement?
negative_passages.docid: 105303
negative_passages.text: 'Obvious' theorems that are actually false
negative_passages.docid: 89127
negative_passages.text: How do I prove if a set of operations is complete?
negative_passages.docid: 105221
negative_passages.text: Confusion about Satisfiability by a denumerable sequence.
negative_passages.docid: 135957
negative_passages.text: Why in an inconsistent axiom system every statement is true? (For Dummies)
negative_passages.docid: 47544
negative_passages.text: A mathematically mature introduction to Turing Machines and Computability [reference-request]
negative_passages.docid: 152437
negative_passages.text: Wavefunction, probability and impossible events
negative_passages.docid: 32441
negative_passages.text: How to prove or disprove statements about sets
negative_passages.docid: 41318
negative_passages.text: Can every proof by contradiction also be shown without contradiction?
negative_passages.docid: 75085
negative_passages.text: Can hypercomputation compute the impossible?
negative_passages.docid: 20190
negative_passages.text: Counter Proof to determinism?
negative_passages.docid: 109858
negative_passages.text: How could a statement be true without proof?
negative_passages.docid: 20462
negative_passages.text: Validity of conditional statement when the premise is false.
negative_passages.docid: 67541
negative_passages.text: When does "X is NP-complete" imply "#X is #P-complete"?