decide

(redirected from decidable)
Also found in: Dictionary, Thesaurus, Legal, Encyclopedia, Wikipedia.
Related to decidable: Decidable problem

decide against (someone or something)

1. To choose not to accept someone. Yes, Holly was a strong candidate, but we ultimately decided against her for the job.
2. To choose not to do something. I was so tired that I decided against going out with my friends tonight.
See also: decide

decide among (someone or something)

To choose someone or something from three or more options. We've had so many good candidates for the job that I'm having a very hard time deciding among them.
See also: among, decide

decide between (someone or something)

To choose someone or something when given two options. Holly and Jack are both such good candidates for the job that I'm having a hard time deciding between them.
See also: between, decide

decide for (someone or something)

To rule favorably for someone or something. My client will almost certainly go to jail if the judge doesn't decide for him.
See also: decide

decide in favor of (someone or something)

To rule favorably for someone or something. My client will almost certainly go to jail if the judge doesn't decide in favor of him.
See also: decide, favor, of

decide on (someone or something)

To choose someone or something, usually after a period of deliberation. Yes, Holly was a strong candidate, but we ultimately decided on someone else for the job opening. After agonizing over the menu, I finally decided on mint chocolate chip ice cream.
See also: decide, on
Farlex Dictionary of Idioms. © 2015 Farlex, Inc, all rights reserved.

decide against someone or something

to rule against someone or something; to make a judgment against someone or something. We decided against Tom and chose Larry instead. Jane decided against the supplier.
See also: decide

decide among (someone and someone else)

 and decide among (something and something else)
to choose from three or more people; to choose from three or more things. I couldn't decide among all the choices on the menu. I will decide among Fred, Tom, and Alice.
See also: among, decide

decide between (someone and someone else)

 and decide between (something and something else)
to choose one from two people; to choose one from two things. I could not decide between Tom and Wally. We could not decide between those two.
See also: between, decide

decide for someone or something

to rule in favor of someone or something; to make a judgment for someone or something. The jury decided for the plaintiff. The judge decided for me.
See also: decide

decide in favor of someone or something

to determine that someone or something is the winner. The judge decided in favor of the defendant. I decided in favor of the red one.
See also: decide, favor, of

decide (up)on someone or something

to choose someone or something; to make a judgment about some aspect of someone or something. (Upon is formal and less commonly used than on.) Will you please hurry up and decide upon someone to vote for? I decided on chocolate.
See also: decide, on
McGraw-Hill Dictionary of American Idioms and Phrasal Verbs. © 2002 by The McGraw-Hill Companies, Inc.

decide on

or decide upon
v.
To choose something or someone after deliberation: We decided on green as the color for the nursery. I've decided upon the red shoes; you can put the black ones back.
See also: decide, on
The American Heritage® Dictionary of Phrasal Verbs. Copyright © 2005 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
See also:
References in periodicals archive ?
He uses the phrase "effectively decidable" not as it is usually used by logicians (which is how I have been using it), namely as a predicate of properties, relations and sets, but as a predicate of individual statements.
Theorem 1 Divergence and convergence are decidable in PA[pi].
For ground Horn clauses, N [satisfies] C is decidable in time linear in the sum of the sizes of N and C.
PTL is decidable (for example, using a decision procedure based on the semantic tables method), and it is possible to build a sound and complete deductive system for the logic.
For now, in addition to the typical questions concerning mathematical modelling raised above in describing that charge, there can be added more general questions such as, 'Why should it not even be logically possible that infinitely many particles actually exist with determinate properties not "decidable" by us, whatever "decision methods" are allowed?' Whether somehow this charge can be averted or circumvented will be discussed further in the final section below.
Consider the following case: At the time Caesar stepped into the Rubicon it was decidable whether or not he stepped in with his right foot first.
Precisely because of what Derrida calls this "double bond, this double ligament," the fetish would oscillate such that its truth is not decidable. Thus - and here is the essential twist of Derrida's reading - even if the fetish oscillates between contrary, or opposing, positions, the very fact that it can only exist as oscillating implies that nothing can be opposed to it.
Deconstruction participates in what Derrida nominates "two violences": the divine which is "the decision without decidable certainty" and the state which is "the certainty of the undecidable but without decision" (FL 1035).
You can't do this work of juxtaposition in a Hollywood plot, which excludes everything that is really significant and not readily decidable.
In her discussion, Tania Modleski argues that the film's seemingly secure ("decidable") patriarchal ideology actually "exceeds" itself and in an act of self-deconstruction becomes differential and "undecidable." In her view, in Vertigo the "masculine" turns out to be not "opposed" to the "feminine," as common sense proposes, but in fact a part of it.
However, real computers have finite memories, not infinite ones, and hence, the proper mathematical model for a real computer is a finite state machine (for which the halting problem is decidable).
Notably, each computable function can be expressed by a finitely ground program; membership in this class is not decidable, but it has been proven to be semidecidable (Calimeri et al.
Here we prove that SRCP restricted to |I| = 2 and k = 3 is decidable in polynomial time.
Luckily, there exists one type of hybrid automaton called the polynomial hybrid automaton; its reachability analysis is proved decidable. Then it is very valuable to construct an approximate polynomial hybrid automaton of a common one.
Finally, for finitely generated groups with decidable word problem, Martin-Lof randomness can be defined: such definition depends on the measure defined on the Borel [sigma]-algebra, which for our aims will be the product measure.