Results 41 to 50 of about 70,846 (249)
Forum of Mathematics, Pi, 2023 We define, for each quasisyntomic ring R (in the sense of Bhatt et al., Publ. Math. IHES 129 (2019), 199–310), a category $\mathrm {DM}^{\mathrm {adm}}(R)$ of admissible prismatic Dieudonné crystals over R and a functor from p-divisible groups ...
Johannes Anschütz +1 more
doaj +1 more source
Can we repudiate ontology altogether?
Noûs, EarlyView.Abstract Ontological nihilists repudiate ontology altogether, maintaining that ontological structure is an unnecessary addition to our theorizing. Recent defenses of the view involve a sophisticated combination of highly expressive but ontologically innocent languages combined with a metaphysics of features—non‐objectual, complete but modifiable states
Christopher J. Masterman
wiley +1 more source
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
A completion functor for Cauchy groups
International Journal of Mathematics and Mathematical Sciences, 1981 A completion functor is constructed on the category of completely normal Cauchy groups and Cauchy-continuous homomorphisms. A competion functor is also obtained for a corresponding category of convergence groups.
R. Fric, D. C. Kent
doaj +1 more source
Weak Homomorphisms of Coalgebras Beyond Set
Demonstratio Mathematica, 2014 We study the notion of weak homomorphisms between coalgebras of different types generalizing thereby that of homomorphisms for similarly typed coalgebras. This helps extend some results known so far in the theory of Universal coalgebra over Set.
Kianpi Maurice
doaj +1 more source
Proper Functors and Fixed Points for Finite Behaviour [PDF]
Logical Methods in Computer Science, 2018 The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e.
Stefan Milius
doaj +1 more source
Revisiting (∞,2)${(\infty,2)}$‐naturality of the Yoneda embedding
Bulletin of the London Mathematical Society, EarlyView.Abstract We show that the Yoneda embedding ‘is’ (∞,2)$(\infty,2)$‐natural with respect to the functoriality of presheaves via left Kan extension, refining the (∞,1)$(\infty,1)$‐categorical result proven independently by Haugseng–Hebestreit–Linskens–Nuiten and Ramzi, and answering a question of Ben‐Moshe.
Tobias Lenz
wiley +1 more source
Neat embeddings as adjoint situations
, 2013 We view the neat reduct operator as a functor that lessens dimensions from CA_{\alpha+\omega} to CA_{\alpha} for infinite ordinals \alpha. We show that this functor has no right adjoint. Conversely for polyadic algebras, and several reducts thereof, like
Ahmed, Tarek Sayed
core +1 more source
Information Operators in Categorical Information Spaces
Information, 2010 The general theory of information (GTI) is a synthetic approach, which reveals the essence of information, organizing and encompassing all main directions in information theory.
Mark Burgin
doaj +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source