Sentence examples for class of logic from inspiring English sources

To encompass the whole class of logic systems one finds in the literature, a slightly more general definition than Tarski's is required.

Despite the fact that algebraic fibring is suitable for combining an ample class of logic systems, some kinds of logics, namely substructural logics such as linear logic, and logics equipped with a nondeterministic semantics, lie outside the scope of this combination method.

The class of protoalgebraic logics turned out to be the class of logics for which the theory of logical matrices works really well in the sense that many results of universal algebra have counterparts for the classes of reduced matrix models of these logics; consequently the algebraic study of protoalgebraic logics using their matrix semantics has been very fruitful.

Boolean games are a natural, compact, and expressive class of logic-based games, in which each player exercises unique control over some set of Boolean variables, and has some logical goal formula that it desires to be achieved.

Our work is another step towards the aim of exploiting the rich belief change literature for addressing the evolution problem in a larger class of logics.

The novelty here is that this technique applies to a broad class of logics, which are not necessarily restricted to (normal) modal logics, as in the case of fusion.

Equivalential logics were first considered as a class of logics deserving to be studied in Prucnal & Wrónski 1974, and they have been studied extensively in Czelakowski 1981; see also Czelakowski 2001.

The efficient learnability of restricted classes of logic programs is studied in the PAC framework of computational learning theory.

We study in depth the computational complexity of FLP and well-justified FLP answer sets for general classes of logic programs.

However, it was recently observed that when being extended from normal to more general classes of logic programs, this approach may produce answer sets with circular justifications that are caused by self-supporting loops.

We prove that under appropriate weak fairness assumptions all these specifications are stuttering bisimilar and that large classes of logic temporal formulas, namely all CTL⁎∖X formulas, are preserved.