On positive, linear and quadratic Boolean functions
Sergiu Rudeanu (2012)
Kragujevac Journal of Mathematics
Similarity:
Sergiu Rudeanu (2012)
Kragujevac Journal of Mathematics
Similarity:
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. ...
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.
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.
Gonda, J. (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Čomić, Lidija, Tošić, Ratko (2004)
Novi Sad Journal of Mathematics
Similarity:
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.
Gonda, J. (2007)
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...
Saharon Shelah (2000)
Fundamenta Mathematicae
Similarity:
The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, and then there are Boolean algebras such that . Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if is a ccc Boolean algebra and then satisfies the λ-Knaster condition (using the “revised GCH theorem”).