Displaying similar documents to “On the implementation of set-valued non-Boolean functions.”

Program Algebra over an Algebra

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting variables and supporting terms which determine the value of free variables in the next state. The execution of a program is changing state according to successor function using supporting terms. ...

On the existence of prime ideals in Boolean algebras

Jörg Flum (1999)

Banach Center Publications

Similarity:

Rasiowa and Sikorski [5] showed that in any Boolean algebra there is an ultrafilter preserving countably many given infima. In [3] we proved an extension of this fact and gave some applications. Here, besides further remarks, we present some of these results in a more general setting.

A model theory approach to structural limits

Jaroslav Nešetřil, Patrice Ossona de Mendez (2012)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an example, we generalize limits of bounded degree graphs from subgraph testing to finite model testing.