Sentence examples for theoretic assumption from inspiring English sources

We conclude that the rule is to be rejected to preserve the soundness of S5 relatively to this model theoretic assumption.

In short, Pascal's wager has no pull on strict atheists.[9] Finally, one could question Pascal's decision theoretic assumption that rationality requires one to perform the act of maximum expected utility (when there is one).

We show that for most of the considered problems, task (i) admits a polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, in contrast to task (ii) which does not admit such a reduction to a problem kernel of polynomial size, subject to a complexity theoretic assumption.

Due to undersampling, the theoretic assumption that C and A are independent does not hold in general if the context automaton C is extracted from an empirically sampled finite time series.

Note, that this is a completely theoretic assumption in order to illustrate the occurring problems regarding the most simple scenario.

To explain these puzzling results, several researchers began to move beyond standard game theoretic assumptions and appeal to a justice motive.

Finally, our proposed methodology and obtained results can act supplementary to the existing and future studies that incorporate relevant theoretic assumptions, rendering them more viable for practical applications.

This is, indeed, what many economists in the early days of research on the ultimatum game predicted would happen, on the basis of standard game theoretic assumptions (Kahneman et al. 1986: S285 286; Pillutla and Murnighan 1995: 1409; Güth 1995: 329).

By applying this extension we are able to answer some open questions in Lutz (Theory Comput. Systems 30 (1997) 429 442) regarding the derandomization of the classes BP·ΣPk and BP· ΘPk under plausible measure theoretic assumptions.

For deciding e.g. skeptical acceptance of an argument under preferred semantics one requires in general an exponential number of calls to the SAT solver (under standard complexity theoretic assumptions).

The iterative approach is suitable when the problem to be solved cannot be decided in general (under standard complexity theoretic assumptions) by the satisfiability of a single propositional formula (constructible in polynomial time) without quantifiers.