Abstract. We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the num...

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element JaK which is the denotation of the term a (which is also a variable symbol). Similarly, the algebra interpreting predicates in the model directly interprets open predicat...

Recently it has been argued that some of the fine-tuning problems of the MSSM inflation associated with the existence of a saddle point along a flat direction may be solved naturally in a class of supergravity models. Here we extend the analysis and show that the constraints on the Kähler potentials in these models are considerably relaxed when the location of the saddle point is treated as a f...

In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infmi~y term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowledge operator. As the full predicate logics of common knowledge are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with...

We present a road map for a joint project of the simulation league and the humanoid league that we call 3D2Real. This project is concerned with the integration of these two leagues which is becoming increasingly important as the research fields are converging. Currently, a lot of work is duplicated across the leagues, collaboration is sparse, and knowhow is not transfered effectively. This bind...

ion Let τ = λx.σ. By the induction hypothesis, σ defines a function of its free variables. Let those free variables be of types D0, . . . ,Dn where Dn is the type of x. Then σ defines an approximable function g : D0 × . . .×Dn → D′ where D′ is the type of σ. Using Theorem 3.12, the function curry(g) : D0 × . . .×Dn−1 → (Dn → D′) yields an approximable function, but this is just the function def...

The paper considers the set ML1 of rst-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using the mosaic technique, we prove a general satissability criterion for formulas in ML1 which reduces the modal satissability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragm...

Van Lambalgen (1991) proposed a translation from a language containing a generalized quanti er Q into a rst-order language enriched with a family of predicates R i , for every arity i (or an in nitary predicate R) which takes Qx (x; y 1 ; : : : ; y n ) to 8x(R(x; y 1 ; : : : ; y n ) ! (x;y 1 ; : : : ; y n )) (y 1 ; : : : ; y n are precisely the free variables of Qx ). The logic of Q (without or...