Results 71 to 80 of about 1,294 (213)

Hom ω$\omega$‐categories of a computad are free

Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.
Abstract We provide a new description of the hom functor on weak ω$\omega$‐categories, and show that it admits a left adjoint that we call the suspension functor. We then show that the hom functor preserves the property of being free on a computad, in contrast to the hom functor for strict ω$\omega$‐categories.
Thibaut Benjamin, Ioannis Markakis
wiley   +1 more source

Completeness of Boolean powers of Boolean algebras

Journal of the Mathematical Society of Japan, 1988
For complete Boolean algebras A and B, let A[B] denote the Boolean power of A by B. This paper investigates conditions under which A[B] is a complete Boolean algebra, using techniques of Boolean valued models. The link between this problem and Boolean valued models is provided by a result of \textit{R. M. Solovay} and \textit{S. Tennenbaum} [Ann. Math.,
openaire   +2 more sources

The six operations in topology

Journal of Topology, Volume 18, Issue 4, December 2025.
Abstract In this paper, we show that the six functor formalism for sheaves on locally compact Hausdorff topological spaces, as developed, for example,‐ in Kashiwara and Schapira's book Sheaves on Manifolds, can be extended to sheaves with values in any closed symmetric monoidal ∞$\infty$‐category which is stable and bicomplete. Notice that, since we do
Marco Volpe
wiley   +1 more source

ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

BMC Bioinformatics, 2011
Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze
Blekherman Grigoriy, McNeill Rustin, Guang Bonny, Brandon Madison, Hinkelmann Franziska, Veliz-Cuba Alan, Laubenbacher Reinhard   +6 more
doaj   +1 more source

Scaling Invariant Generation Using State Space Embeddings and GPU Streaming

Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The formal verification of railway control systems can ensure the safety of complex scheme plans through techniques such as induction‐based model checking. While inductive verification performs well in complex settings, it often produces false positives due to its consideration of transitions from unreachable safe states to unsafe states ...
Ben Lloyd‐Roberts, Filippos Pantekis, Phillip James, Liam O'Reilly, Michael Edwards   +4 more
wiley   +1 more source

On annihilators in BL-algebras

Open Mathematics, 2016
In the paper, we introduce the notion of annihilators in BL-algebras and investigate some related properties of them. We get that the ideal lattice (I(L), ⊆) is pseudo-complemented, and for any ideal I, its pseudo-complement is the annihilator I⊥ of I ...
Zou Yu Xi, Xin Xiao Long, Fei He Peng
doaj   +1 more source

Investigation of Preschoolers’ Mathematical Skills: A Systematic Literature Review [PDF]

Educational Process: International Journal
Background/purpose. Awareness of the mathematical skills and knowledge children possess in their early years is widely accepted. This includes various common positive aspects, not only for educators but also for researchers and policymakers.
Antonia Petropoulou , Konstantinos Lavidas , Stamatis Papadakis
doaj   +1 more source

Fulfilling the Promise of ‘Leaving No One Behind’: Exploring Institutional Pathways to Success

Sustainable Development, Volume 33, Issue S1, Page 77-90, November 2025.
ABSTRACT The 2030 Agenda's Leaving No One Behind (LNOB) principle has the potential to offer a new approach to development, but whether it is achieved largely depends on how it is institutionalised within countries. This research provides the first empirical study into the relation between institutionalisation of LNOB and its goal achievement.
Eileen de Jong, Sebastiaan Princen, Marjanneke J. Vijge   +2 more
wiley   +1 more source

A maximal Riesz-Kantorovich theorem with applications to markets with an arbitrary commodity set

Математичні Студії
By analyzing proofs of the classical Riesz-Kantorovich theorem, the Mazón-Segura de León theorem on abstract Uryson operators and the Pliev-Ramdane theorem on C-bounded orthogonally additive operators on Riesz spaces, we find the most general (to our ...
M. M. Popov, O. Z. Ukrainets
doaj   +1 more source

Completion of Boolean algebras in MSet

The Journal of Logic and Algebraic Programming, 2009
The aim of this paper is to study the general notion of an internally complete poset in a topos, in the sense of Johnstone, and to use it to give minimal normal completions for \(M\)-Boolean algebras (Boolean algebras with an action of a monoid \(M\) on them).
Ebrahimi, M. Mehdi, Mahmoudi, M.
openaire   +2 more sources