The entropy on -quantum spaces
The equiconsistency of two large cardinal axioms
The equivalence of definable quantifiers in second order arithmetic
The even-odd hat problem
We answer a question of C. Hardin and A. Taylor concerning a hat-guessing game.
The existence of -points of N* for
The existence of states on every Archimedean atomic lattice effect algebra with at most five blocks
Effect algebras are very natural logical structures as carriers of probabilities and states. They were introduced for modeling of sets of propositions, properties, questions, or events with fuzziness, uncertainty or unsharpness. Nevertheless, there are effect algebras without any state, and questions about the existence (for non-modular) are still unanswered. We show that every Archimedean atomic lattice effect algebra with at most five blocks (maximal MV-subalgebras) has at least one state, which...
The existence of universal invariant measures on large sets
The exocenter of a double Heyting algebra
The Feferman-Vaught theorem for reduced ideal-products.
The Feferman-Vaught theorem revisited
The Field of Reals with a Predicate for the Powers of Two.
The finite levels of the hierarchy of effective R-sets
The First Isomorphism Theorem and Other Properties of Rings
Different properties of rings and fields are discussed [12], [41] and [17]. We introduce ring homomorphisms, their kernels and images, and prove the First Isomorphism Theorem, namely that for a homomorphism f : R → S we have R/ker(f) ≅ Im(f). Then we define prime and irreducible elements and show that every principal ideal domain is factorial. Finally we show that polynomial rings over fields are Euclidean and hence also factorial
The First Mean Value Theorem for Integrals
In this article, we prove the first mean value theorem for integrals [16]. The formalization of various theorems about the properties of the Lebesgue integral is also presented.MML identifier: MESFUNC7, version: 7.8.09 4.97.1001
The first order properties of Dedekind finite integers
The Formal Construction of Fuzzy Numbers
In this article, we continue the development of the theory of fuzzy sets [23], started with [14] with the future aim to provide the formalization of fuzzy numbers [8] in terms reflecting the current state of the Mizar Mathematical Library. Note that in order to have more usable approach in [14], we revised that article as well; some of the ideas were described in [12]. As we can actually understand fuzzy sets just as their membership functions (via the equality of membership function and their set-theoretic...
The Formalization of Decision-Free Petri Net
In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it only removes the available tokens (i.e., it does not remove from zero number of tokens). At the end of this...
The free one-generated left distributive algebra: basics and a simplified proof of the division algorithm
The left distributive law is the law a· (b· c) = (a·b) · (a· c). Left distributive algebras have been classically used in the study of knots and braids, and more recently free left distributive algebras have been studied in connection with large cardinal axioms in set theory. We provide a survey of results on the free left distributive algebra on one generator, A, and a new, simplified proof of the existence of a normal form for terms in A. Topics included are: the confluence of A, the linearity...
The Frobenius relations meet linear distributivity.
The Functor Bext under the Negation of CH.