相关论文: An extension of Kracht's theorem to generalized Sa…
In 1988, Brown and Ellis published [3] a generalised Hopf formula for the higher homology of a group. Although substantially correct, their result lacks one necessary condition. We give here a counterexample to the result without that…
In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…
The theory of abstract Friedrichs operators, introduced by Ern, Guermond and Caplain (2007), proved to be a successful setting for studying positive symmetric systems of first order partial differential equations (Friedrichs, 1958),…
We describe the second cohomology of a regular semisimple Hessenberg variety by generators and relations explicitly in terms of GKM theory. The cohomology of a regular semisimple Hessenberg variety becomes a module of a symmetric group…
The class $\mathfrak C $ relative to countably compact topological spaces and the class $\mathfrak P$ relative to pseudocompact spaces introduced by Z. Frol\'ik are naturally generalized relative to every topological property. We provide a…
We analyse some aspects of the notion of algebraic exponentiation introduced by the second author [16] and satisfied by the category of groups. We show how this notion provides a new approach to the categorical-algebraic question of the…
Quantum categories were introduced in [4] as generalizations of both bi(co)algebroids and small categories. We clarify details of that work. In particular, we show explicitly how the monadic definition of a quantum category unpacks to a set…
A classical reconstruction of Wright's first-order logic of strict finitism is presented. Strict finitism is a constructive standpoint of mathematics that is more restrictive than intuitionism. Wright sketched the semantics of said logic in…
In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…
We extend the diagrammatic calculus of syllogisms introduced in our previous paper to the general case of n-term syllogisms, showing that the valid ones are exactly those whose conclusion follows by calculation. Moreover, by pointing out…
We consider Blanchet, Habegger, Masbaum and Vogel's universal construction of topological theories in dimension two, using it to produce interesting theories that do not satisfy the usual two-dimensional TQFT axioms. Kronecker's…
In recent papers and books, a global quantization has been developed for unimodular groups of type I. It involves operator-valued symbols defined on the product between the group $\mathsf{G}$ and its unitary dual $\widehat{\mathsf{G}}$,…
This paper introduces a new generalized superfactorial function (referable to as $n^{th}$- degree superfactorial: $sf^{(n)}(x)$) and a generalized hyperfactorial function (referable to as $n^{th}$- degree hyperfactorial: $H^{(n)}(x)$), and…
Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
Using canonical quantisation, and eschewing the Schwinger-Keldysh path integral, we derive a version of the Worldline Quantum Field Theory (WQFT) formalism suitable for both scattering and bound configurations of the classical two-body…
Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a…
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…