Related papers: Nominal C-Unification
Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the forall-quantifier or lambda-binder are just…
We propose a definition of what should be meant by a {\it proper} action of a locally compact group on a C*-algebra. We show that when the C*-algebra is commutative this definition exactly captures the usual notion of a proper action on a…
Simple cardinality refers to counting nonzero elements of an independent variable satisfying certain properties. Composite cardinality is a simple counting process composited with an affine mapping, and is therefore more complicated than…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
A semiregular operator on a Hilbert C^*-module, or equivalently, on the C^*-algebra of `compact' operators on it, is a closable densely defined operator whose adjoint is also densely defined. It is shown that for operators on extensions of…
Considering the large number of fractional operators that exist, and since it does not seem that their number will stop increasing soon at the time of writing this paper, it is presented for the first time, as far as the authors know, a…
We present a unified framework to construct well-posed formulations for large classes of linear operator equations including elliptic, parabolic and hyperbolic partial differential equations. This general approach incorporates known weak…
We classify all decompositions of $M_3(\mathbb{C})$ into a direct vector-space sum of two subalgebras such that one of the subalgebras contains the identity matrix.
This paper presents a novel SHOI tableau calculus which incorporates algebraic reasoning for deciding ontology consistency. Numerical restrictions imposed by nominals, existential and universal restrictions are encoded into a set of linear…
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It…
We give the first examples of (non-amenable group) amenable actions on stably finite simple C*-algebras. More precisely, we give such actions for any countable group in an explicit way. The main ingredients of our construction are the full…
Even if binary relations and orders are a common formalization topic, we need to formalize specific orders (namely monomial and graded) in the process of formalizing in Rocq the finite element method. This article is therefore definitions,…
We present a convenient notation for positive/negative-conditional equations. The idea is to merge rules specifying the same function by using case-, if-, match-, and let-expressions. Based on the presented macro-rule-construct,…
A Q-system in a C* 2-category is a unitary version of a separable Frobenius algebra object and can be viewed as a unitary version of a higher idempotent. We define a higher unitary idempotent completion for C* 2-categories called Q-system…
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…
We provide some background on the category of classifiable $\mathrm{C}^*$-algebras, whose objects are infinite-dimensional, simple, separable, unital $\mathrm{C}^*$-algebras that have finite nuclear dimension and satisfy the universal…
We will investigate the norm closure of the unitary and similarity orbits of normal operators in unital, simple, purely infinite C*-algebras. An operator theoretic proof will be given to the classification of when two normal operators are…
We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…
We translate the concept of the join of topological spaces to the language of $C^*$-algebras, replace the $C^*$-algebra of functions on the interval $[0,1]$ with evaluation maps at $0$ and $1$ by a unital $C^*$-algebra $C$ with appropriate…
This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…