Publisher Summary This chapter presents a method that is an analysis of first-order formulas in terms of local properties. A natural simple metric is used in model and the concept of a k-local… Expand

~0. Introduction. The idea of treating probability as a real valued function defined on sentences is an old one (see ['6] and [7], where other references can be found). Carnap's at tempt to set up a… Expand

We propose a framework for discussing fully abstract compositional semantics, which exposes the interrelations between the choices of observables, compositions, and meanings.Expand

We show that boundedness is decidable for monadic Datalog programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity).Expand

A language is considered here as a finite set of symbols (words of the language) together with a set of strings (finite sequences) of these symbols (sentences).Expand