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...

Environments and closures are two of the main ingredients of evaluation in lambdacalculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables. In this paper we investigate some dynamic aspects of evaluation in lambda-calculus considering the quantitative, combinatorial properties of environments and clo...

Still the traditional design approach, and even more the Integrated Design Process, need an effective and efficient design methodology and smart, useful and fast design support tools, in order to fulfil the requirements of low energy buildings besides all other issues included in the “building design”: aesthetic, functionality, budget limit, customer requirements. How can the design team being ...

Prolog systems currently work with the restriction that negative subgoals not contain free variables, although some authors have suggested that this restriction can be lifted by running the theorem prover to exhaustion on the subgoal being considered. We suggest that this approach is likely not to be computationally viable in practice, and describe and formalize a new approach to dealing with q...

(1) ∀u, k∀v ≤ρ tuk∃w A0(u, k, v, w), where A0 is a quantifier–free formula 1 (containing only u, k, v, w as free variables) in the language of a suitable subsystem T ω of arithmetic in all finite types, t is a closed term and ≤ρ is defined pointwise (ρ being an arbitrary finite type). Lets suppose that (1) is provable in T . Then from a given such proof one can extract an effective uniform boun...

We consider the monodic formulas of common knowledge predicate logic, which allow applications of epistemic operators to formulas with at most one free variable. We provide nite axiomatizations of the monodic fragment of the most important common knowledge predicate logics (the full logics are known to be not recursively enumerable) and single out a number of their decidable fragments. On the o...

A formula '(x 1 ; : : :; x n) conforms to a partition P of fx 1 ; : : :; x n g if it is equivalent to a Boolean combination of formulae that do not have free variables from more than one block of P. We show that if ' conforms to two partitions P 1 and P 2 , it also conforms to their greatest lower bound in the partition lattice. As a corollary, we obtain that the concept of orthographic dimensi...

The issue of the breakdown of the marriage bond in Western societies has become a routine object of social and moral concern, political and public debate. This is striking, given that in most non-western cultures still and in every society heretofore, marriage has been insisted upon as the required precondition for the mating of men and women as the act that initiates and sustains the family or...

This paper reports our ongoing research effort to develop a system which translates legal texts into logical forms in which we can check for inconsistency. Our logical formalization conforms to Davidsonian Style, which is suitable for languages allowing expressions with zero-pronouns such as Japanese. We examine our system with actual data of legal documents. As a result, the system was 78% of ...

Second-order uniication is undecidable in general. Miller showed that uniication of so-called higher-order patterns is decidable and unitary. We show that the uniication of a linear higher-order pattern s with an arbitrary second-order term that shares no variables with s is decidable and nitary. A few extensions of this uniication problem are still decidable: unifying two second-order terms, w...