Grzegorz Bancerek (2013)
Formalized Mathematics
Similarity:
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of 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. ...
Sergiu Rudeanu (2012)
Kragujevac Journal of Mathematics
Similarity:
Antonio Aizpuru (1996)
Colloquium Mathematicae
Similarity:
We study local interpolation properties and local supremum properties for a Boolean algebra. In particular, we present a new condition that is sufficient for the Nikodym property.
Gonda, J. (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Marco Caminati (2011)
Formalized Mathematics
Similarity:
Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are...
Gonda, J. (2007)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Věra Trnková (2006)
Archivum Mathematicum
Similarity:
Clone properties are the properties expressible by the first order sentence of the clone language. The present paper is a contribution to the field of problems asking when distinct sentences of the language determine distinct topological properties. We fully clarify the relations among the rigidity, the fix-point property, the image-determining property and the coconnectedness.
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.