We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate. We show that a slice exists for a global predicate iff the predicate is a regular predicate. We then give an efficient algorith...

Quantification theory, or first-order predicate logic, can be formulated in terms purely of predicate letters and a few predicate functors which attach t o predicates to form further predicates. Apart from the predicate letters, which are schematic, there are no variables. On this score the plan is reminiscent of the combinatory logic of Schonfinkel and Curry. Theirs, however, had the whole of ...

In this paper we study generic expansions of predicate logics of some left-continuous t-norms (mainly Gödel and Nilpotent Minimum predicate logics) with a countable set of truth-constants. Using known results on tnorm based predicate fuzzy logics we obtain results on the conservativeness and completeness for the expansions of some predicate fuzzy logics. We describe the problem for the cases of...

The predicate logic gates are proposed for spatially modulated signals. Two voltage impulses are transmitted along the coupled wires, and they are considered as a predicate expression. The developed gates perform the logical operations AND, NOT and OR with these expressions. They are used for a predicate logic microprocessor. Key-Words: Artificial spatial intelligence, predicate logic, topologi...

We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal interm...

This paper briefly presents the canonical HPSG treatment of predicate complements (Section 1) and points out a number of problems with it (Section 2). Then it presents an alternative (Section 3) and shows how it avoids or solves the problems with the canonical treatment (Section 4). 1 The raising treatment of the predicate complements In mainstream HPSG predicate complements are treated along t...

Designing basic protocols, used in networking, security and multiprocessor systems is hard. All of these have to deal with concurrency, that is the actions of multiple agents in parallel. This makes their design error-prone since all possible interactions between the various agents in the system have to be considered. In addition to concurrency, many of these protocols are designed to work with...