The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 81 –
100 of
150
Based on [16], authors formalized the integral of an extended real valued measurable function in [12] before. However, the integral argued in [12] cannot be applied to real-valued functions unconditionally. Therefore, in this article we have formalized the integral of a real-value function.
We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system...
We present an abstract equational framework for the specification of systems having both
observational and computational features. Our approach is based on a clear separation between the two
categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a
coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined
notion of reachability under computations. The relationship between the computations yielding new system
states...
Topological Boolean algebras are generalizations of topological spaces defined by means of topological closure and interior operators, respectively. The authors in [14] generalized topological Boolean algebras to closure and interior operators of MV-algebras which are an algebraic counterpart of the Łukasiewicz infinite valued logic. In the paper, these kinds of operators are extended (and investigated) to the wide class of bounded commutative Rl-monoids that contains e.g. the classes of BL-algebras...
Bounded integral residuated lattices form a large class of algebras containing some classes of algebras behind many valued and fuzzy logics. In the paper we introduce and investigate multiplicative interior and additive closure operators (mi- and ac-operators) generalizing topological interior and closure operators on such algebras. We describe connections between mi- and ac-operators, and for residuated lattices with Glivenko property we give connections between operators on them and on the residuated...
-algebras endowed with additive closure operators or with its duals-multiplicative interior operators (closure or interior -algebras) were introduced as a non-commutative generalization of topological Boolean algebras. In the paper, the multiplicative interior and additive closure operators on -monoids are introduced as natural generalizations of the multiplicative interior and additive closure operators on -algebras.
Commutative bounded integral residuated lattices form a large class of algebras containing some classes of algebras behind many valued and fuzzy logics. In the paper we introduce and investigate additive closure and multiplicative interior operators on this class of algebras.
We generalize the notion of a fat subset of a regular cardinal κ to a fat subset of , where κ ⊆ X. Suppose μ < κ, , and κ is supercompact. Then there is a generic extension in which κ = μ⁺⁺, and for all regular λ ≥ μ⁺⁺, there are stationarily many N in which are internally club but not internally approachable.
We call a topological space -compact if every subset of size has a complete accumulation point in it. Let denote the following statement: and there is such that whenever . We show that if holds and the space is both -compact and -compact then is -compact as well. Moreover, from PCF theory we deduce for every singular cardinal . As a corollary we get that a linearly Lindelöf and -compact space is uncountably compact, that is -compact for all uncountable cardinals .
Currently displaying 81 –
100 of
150