Conjunctively polynomial-like Boolean functions.
Gonda, J. (2007)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Gonda, J. (2007)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
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.
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”).
Strassburger, Lutz (2007)
Theory and Applications of Categories [electronic only]
Similarity:
Katsumi Wasaki (2008)
Formalized Mathematics
Similarity:
To evaluate our formal verification method on a real-size calculation circuit, in this article, we continue to formalize the concept of the 4-2 Binary Addition Cell primitives (FTAs) to define the structures of calculation units for a very fast multiplication algorithm for VLSI implementation [11]. We define the circuit structure of four-types FTAs, TYPE-0 to TYPE-3, using the series constructions of the Generalized Full Adder Circuits (GFAs) that generalized adder to have for each positive...
Freyd, Peter (2008)
Theory and Applications of Categories [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...
A. Morawiec, B. Węglorz (1993)
Colloquium Mathematicae
Similarity:
It is well known that if a nontrivial ideal ℑ on κ is normal, its quotient Boolean algebra P(κ)/ℑ is -complete. It is also known that such completeness of the quotient does not characterize normality, since P(κ)/ℑ turns out to be -complete whenever ℑ is prenormal, i.e. whenever there exists a minimal ℑ-measurable function in . Recently, it has been established by Zrotowski (see [Z1], [CWZ] and [Z2]) that for non-Mahlo κ, not only is the above condition sufficient but also necessary...
Andrzej Nowik (1999)
Colloquium Mathematicae
Similarity:
We prove some properties of uniformly completely Ramsey null sets (for example, every hereditarily Menger set is uniformly completely Ramsey null).
Trnková, V, Sichler, J. (2008)
Theory and Applications of Categories [electronic only]
Similarity:
Veldsman, Stefan (2003)
Beiträge zur Algebra und Geometrie
Similarity:
A. F. Ber, Vladimir I. Chilin, Fyodor A. Sukochev (2006)
Extracta Mathematicae
Similarity:
Necessary and sufficient conditions are given for a (complete) commutative algebra that is regular in the sense of von Neumann to have a non-zero derivation. In particular, it is shown that there exist non-zero derivations on the algebra L(M) of all measurable operators affiliated with a commutative von Neumann algebra M, whose Boolean algebra of projections is not atomic. Such derivations are not continuous with respect to measure convergence. In the classical setting of the algebra...