verb (used with object), refuted, refuting.
to prove to be false or erroneous, as an opinion or charge.
to prove (a person) to be in error.

1505–15; < Latin refūtāre to check, suppress, refute, rebut, equivalent to re- re- + -fūtāre presumably, “to beat” (attested only with the prefixes con- and re-; cf. confute)

refutable [ri-fyoo-tuh-buhl, ref-yuh-tuh-] , adjective
refutability, noun
refutably, adverb
refuter, noun
self-refuted, adjective
self-refuting, adjective
unrefutable, adjective
unrefutably, adverb
unrefuted, adjective
unrefuting, adjective

1. deny, disapprove, disprove, rebut, refute (see synonym study at deny) ; 2. disapprove, disprove, rebut, refute ; 3. dispute, refute ; 4. repudiate, refute, refudiate (see word story at refudiate).

1. disprove, rebut. 1, 2. confute. Unabridged
Based on the Random House Dictionary, © Random House, Inc. 2014.
Cite This Source Link To refutable
World English Dictionary
refute (rɪˈfjuːt)
1.  (tr) to prove (a statement, theory, charge, etc) of (a person) to be false or incorrect; disprove
2.  to deny (a claim, charge, allegation, etc)
[C16: from Latin refūtāre to rebut]
usage  The use of refute to mean deny is thought by many people to be incorrect

Collins English Dictionary - Complete & Unabridged 10th Edition
2009 © William Collins Sons & Co. Ltd. 1979, 1986 © HarperCollins
Publishers 1998, 2000, 2003, 2005, 2006, 2007, 2009
Cite This Source
Word Origin & History

1513, "refuse, reject," from L. refutare "drive back, repress, repel, rebut," from re- "back" + -futare "to beat," probably from PIE base *bhat- "to strike down" (cf. beat). Meaning "prove wrong" dates from 1545. Since c.1964 linguists have frowned on the subtle shift in meaning towards "to deny," as
it is used in connection with allegation.
Online Etymology Dictionary, © 2010 Douglas Harper
Cite This Source
Computing Dictionary

refutable definition

In lazy functional languages, a refutable pattern is one which may fail to match. An expression being matched against a refutable pattern is first evaluated to head normal form (which may fail to terminate) and then the top-level constructor of the result is compared with that of the pattern. If they are the same then any arguments are matched against the pattern's arguments otherwise the match fails.
An irrefutable pattern is one which always matches. An attempt to evaluate any variable in the pattern forces the pattern to be matched as though it were refutable which may fail to match (resulting in an error) or fail to terminate.
Patterns in Haskell are normally refutable but may be made irrefutable by prefixing them with a tilde (~). For example,
(\ (x,y) -> 1) undefined ==> undefined (\ ~(x,y) -> 1) undefined ==> 1
Patterns in Miranda are refutable, except for tuples which are irrefutable. Thus
g [x] = 2 g undefined ==> undefined
f (x,y) = 1 f undefined ==> 1
Pattern bindings in local definitions are irrefutable in both languages:
h = 1 where [x] = undefined ==> 1 Irrefutable patterns can be used to simulate unlifted products because they effectively ignore the top-level constructor of the expression being matched and consider only its components.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Example sentences
In other words: show some actual, valid, repeatable and refutable science and we'll believe you.
However, this presumption of objectivity is refutable based on a persuasive showing by a complainant in a particular instance.
There is a safe harbor and refutable presumption provision for qualified mortgages.
Related Words
Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature