query: Semi-decidability of First Order Logic
positive_passages.docid: 158295
positive_passages.text: First Order Logic clauses decidability
negative_passages.docid: 18968
negative_passages.text: Converting English into first order predicate logic
negative_passages.docid: 95373
negative_passages.text: Additive set function on a semiring of sets
negative_passages.docid: 104771
negative_passages.text: Dedekind's cut and axioms
negative_passages.docid: 91281
negative_passages.text: Proving the so-called "Well Ordering Principle"
negative_passages.docid: 114550
negative_passages.text: Well-ordering theorem and second-order logic
negative_passages.docid: 72371
negative_passages.text: Proof of Strong Induction Using Well-Ordering Principle
negative_passages.docid: 62936
negative_passages.text: Proving equivalencies of two versions of the Axiom of Choice
negative_passages.docid: 28281
negative_passages.text: Different standards for writing down logical quantifiers in a formal way
negative_passages.docid: 122184
negative_passages.text: De Morgan's laws in logic and set theory
negative_passages.docid: 61471
negative_passages.text: Decidability of the Riemann Hypothesis vs. the Goldbach Conjecture
negative_passages.docid: 47222
negative_passages.text: Soundness of a rule of a proof system with respect to the truth tables?
negative_passages.docid: 10598
negative_passages.text: Contrapositive Fitch Proof
negative_passages.docid: 94203
negative_passages.text: Examples for almost-semirings without absorbing zero
negative_passages.docid: 40643
negative_passages.text: Recognizable vs Decidable
negative_passages.docid: 96504
negative_passages.text: First-Order Logic vs. Second-Order Logic
negative_passages.docid: 136284
negative_passages.text: Orderless pattern matching