How do you use Refutable in a sentence? See 10+ example sentences showing how this word appears in different contexts, including synonyms like questionable or deniable, plus the exact meaning.
Refutable in a sentence
Refutable meaning
Able to be refuted, or shown to be false.
Synonyms of Refutable
Using Refutable
- The main meaning on this page is: Able to be refuted, or shown to be false.
- Useful related words include: questionable, confutable, confutative, deniable.
- In the example corpus, refutable often appears in combinations such as: either refutable, refutable or, is refutable.
Context around Refutable
- Average sentence length in these examples: 25.6 words
- Position in the sentence: 1 start, 4 middle, 6 end
- Sentence types: 11 statements, 0 questions, 0 exclamations
Corpus analysis for Refutable
- In this selection, "refutable" usually appears near the end of the sentence. The average example has 25.6 words, and this corpus slice is mostly made up of statements.
- Around the word, either, nor, sense and citation stand out and add context to how "refutable" is used.
- Recognizable usage signals include is either refutable or satisfiable and and therefore refutable then φ. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "refutable" sits close to words such as aadi, aayush and abbottabad, which helps place it inside the broader word index.
Example types with refutable
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
Now if is refutable for some n, it follows that φ is refutable. (13 words)
Now is a formula of degree k and therefore by assumption either refutable or satisfiable. (15 words)
We have proved that φ is either satisfiable or refutable, and this concludes the proof of the Lemma. (18 words)
Then, once this claim (expressed in the previous sentence) is proved, it will suffice to prove " is either refutable or satisfiable" only for φ's belonging to the class C. Note also that if φ is provably equivalent to ψ (i. (41 words)
If on the other hand Theorem 2 holds and φ is valid in all structures, then ¬φ is not satisfiable in any structure and therefore refutable; then ¬¬φ is provable and then so is φ, thus Theorem 1 holds. (39 words)
However, suppose that for every formula φ there is some formula ψ taken from a more restricted class of formulas C, such that " is either refutable or satisfiable" → " is either refutable or satisfiable". (33 words)
Example sentences (11)
However, suppose that for every formula φ there is some formula ψ taken from a more restricted class of formulas C, such that " is either refutable or satisfiable" → " is either refutable or satisfiable".
Now if is refutable for some n, it follows that φ is refutable.
Because of the two meanings of the word undecidable, the term independent is sometimes used instead of undecidable for the "neither provable nor refutable" sense.
If every formula in R of degree k is either refutable or satisfiable, then so is every formula in R of degree k+1.
If on the other hand Theorem 2 holds and φ is valid in all structures, then ¬φ is not satisfiable in any structure and therefore refutable; then ¬¬φ is provable and then so is φ, thus Theorem 1 holds.
In classical logic, the negation of a statement asserts that the statement is false; to an intuitionist, it means the statement is refutable citation (e.
Let us call the class of all such formulas R. We are faced with proving that every formula in R is either refutable or satisfiable.
Now is a formula of degree k and therefore by assumption either refutable or satisfiable.
Then, once this claim (expressed in the previous sentence) is proved, it will suffice to prove " is either refutable or satisfiable" only for φ's belonging to the class C. Note also that if φ is provably equivalent to ψ (i.
We have proved that φ is either satisfiable or refutable, and this concludes the proof of the Lemma.
We immediately restate it in a form more convenient for our purposes: Theorem 2. Every formula is either refutable or satisfiable in some structure.
Common combinations with refutable
These word pairs occur most frequently in English texts:
- either refutable 7×
- refutable or 7×
- is refutable 3×