decide

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

decide

v. for a judge, arbitrator, court of appeals or other magistrate or tribunal to reach a determination (decision) by choosing what is right and wrong according to the law as he/she sees it.

decide

verb adjudge, adjudicate, adjust, agree, arrive at a judgment, ascertain, award, choose, choose a course of action, choose an alternative, choose an option, come to a conclusion, come to an agreement, come to terms, commit oneself, conclude, constituere, decernere, decree, determine, diagnose, diiudicare, dispose of, elect, end, establish, finalize, find, fix, form a resolution, form an opinion, hold, judge, make a choice, make a decision, make a selection, make up one's mind, opt, ordain, pass, pass judgment, pass sentence, pick, pronounce, reach a decision, reach a verdict, referee, resolve, rule, select, sentence, settle, sit in judgment, terminate, umpire, vote
Associated concepts: decide a case, decide a motion, deeided adversely, decided as a matter of law, decided on the merits, decided upon legal principles, jurisdiction to decide
See also: adjudge, adjudicate, arbitrate, ascertain, award, choose, deem, determine, dispose, elect, find, fix, gauge, hear, judge, pass, pass judgment, prescribe, pronounce, select, sentence, settle, stipulate, try
References in periodicals archive ?
On the one hand, there is some prima facie reason for thinking that only decidable concepts can be possessed implicitly.
Now, we can show that convergence and divergence are decidable for POA[[pi].sub.ri] and PA[pi].
Thus, intensional FOL has a simple Tarski first-order semantics, with a decidable unification problem, but we need also the actual world mapping which maps any intensional entity to its actual world extension.
Nevertheless, the answer to the question is always only a form of not answering the question in any decidable way.
This includes automatically verifying that congruence closure, the theory of tree-embeddings, and the theory of nonstrict partial orderings are polynomial time decidable, that propositional logic is in both co-NP and exponential time, and that the first-order theory of total orderings is in co-NP.
Satisfiability (validity) is a decidable problem for a logic if there exists a decision procedure for the satisfiability (validity) of every formula of the logic.
The 1-letter nonemptiness problem for a LAA is decidable in time that is linear in both its hesitant size and its degree.
Given these definitions, the first thing to note is that equality between reals is not a decidable relation: [Mathematical Expression Omitted] is not a theorem of constructive mathematics.
Since the pure domain theory is decidable, we can effectively determine whether this value for OUTPUT represents a number.
This account applies both to decidable and undecidable sentences.
Where it is decidable is with regard to the locations he did not mention: for example, the neck.
The truth of the fetish is that there is a decidable opposition of the substitute to the non-substitute, of the fetish to the non-fetish.