Gelfond-Lifschitz [7] introduced the concept of a stable model M of a Predicate Logic Program P . Here we show that, up to a recursive 1-1 coding, the set of all stable models of finite Predicate Logic Programs and the Π1 classes (equivalently, the set of all infinite branches of recursive trees) coincide (Theorems 4.1 and 5.1). Typical consequences: 1) there are finite Predicate Logic Programs...

This paper includes a simulation model built in order to predict the performance indicessuch aswaiting time by analyzing queue’s components in the real world under uncertain and subjective situation. The objective of this paper is to predict the waiting time of each customer in an M/M/C queuing model. In this regard, to enable decision makers to obtain useful results with enough knowledge on th...

ion • Very successful in (non-probabilistic) model checking − essential for verification of large/infinite-state systems • Construct abstract model A of concrete model M − details not relevant to some property of interest removed − e.g. partition of state space based on a set of predicates • Non-probabilistic case: existential abstraction − conservative: existence of path in M implies existence...

In formal verification, we verify that a system is correct with respect to a specification. Cases like antecedent failure can make a successful pass of the verification procedure meaningless. Vacuity detection can signal such “meaningless” passes of the specification, and indeed vacuity checks are now a standard component in many commercial model checkers. We address two dimensions of vacuity: ...

W e consider the estimation by simulation of probabilities of rare but potentially damaging events i n Markovian systems. The problem is that the rarity of the event mitigates against its frequent occurence in simulation. Here we show how a reverse-time model m a y be simulated in place of the fonuard-time system in order to provide significantly faster estimates of the rare probabilities. A n ...

For each p 2 there exists a model M of I 0 () which satisses the Count(p) principle. Furthermore, if p contains all prime factors of q there exist n; r 2 M and a bijective map f 2 dom(M) mapping f1; 2 A corollary is a complete classiication of the Count(q) versus Count(p) problem. Another corollary shows that the pigeonhole principle for injective maps does not follow from any of the Count(q) p...

The rare K + → π + ν ¯ ν decay is investigated in the context of type II two-Higgs-doublet model (2HDM). By using the existing experimental data of the branching ratio, restrictions on the free parameters of the model m H , and tanβ are obtained: 0.7 ≤ tanβ ≤ 0.8, and 500GeV ≤ m H ≤ 700GeV .

We prove that if V ⊆ V[h] is a generic extension by Prikry forcing then every transitive intermediate model M of ZFC , where V $ M ⊆ V[h] , is again a Prikry generic extension of V . Moreover the family of intermediate models is parametrised by P(ω)/finite. The result is proved by studying V-constructibility degrees of sets in V[h] using parameters in V .

We show that an infinite number of non-unitary minimal models may describe two dimensional turbulent magnetohydrodynamics (MHD), both in the presence and absence of the Alf'ven effect. We argue that the existence of a critical dynamical index results in the Alf'ven effect or equivelently the equipartition of energy. We show that there are an infinite number of conserved quantities in 2D − M HD ...

Assume G is a group definable in a model M of a stable theory T . We prove that the semigroup SG(M) of complete G-types over M is an inverse limit of some semigroups type-definable in M eq. We prove that the maximal subgroups of SG(M) are inverse limits of some definable quotients of subgroups of G. We consider the powers of types in the semigroup SG(M) and prove that in a way every type in SG(...