In this paper, we explore some algebraic properties of linear structural equation modelsthat can be represented by an HTC-identifiable graph. particular, prove that all mixedgraphs are if and only the regression coefficients recovered fromthe covariance matrix using straightforward algebra operations. We also find a set ofpolynomials generates ideal encompasses equality constraints modelon cone...

The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is such that a P/T net and its term representation have the same operational behavior. As opposed to other approaches in the literature, the actions in the algebra do not correspond to the firing of a transition, but to the...

We extend previous constructions of probabilities for a prime event structure E by allowing arbitrary confusion. Our study builds on results related to fairness in event structures that are of interest per se. Executions of E are captured by the set Ω of maximal configurations. We show that the information collected by observing only fair executions of E is confined in some σ-algebra F0, contai...

We study various well-known schemes for defining inductive and co-inductive types from a categorical perspective. Categorically, an inductive type is just an initial algebra and a coinductive type is just a terminal co-algebra. However, in category theory these notions are quite strong, requiring the existence of a certain map and its uniqueness. In a formal system like type theory one usually ...

We extend previous constructions of probabilities for a prime event structure E by allowing arbitrary confusion. Our study builds on results related to fairness in event structures that are of interest per se. Executions of E are captured by the set Ω of maximal configurations. We show that the information collected by observing only fair executions of E is confined in some σ-algebra F0, contai...

In this paper we try to find a computational interpretation for strong form of extensionality, which call "converse extensionality". Converse extensionality principles, arise as the Dialectica axiom were first studied by Howard. order give these reconsider Brouwer's apartness relation, constructive inequality. Formally, provide categorical construction endow every typed combinatory algebra with...

The starting points for this paper are simple descriptions of the norm and strong* closures of the unitary orbit of a normal operator in a von Neumann algebra. The statements are in terms of spectral data and do not depend on the type or cardinality of the algebra. We relate this to several known results and derive some consequences, of which we list a few here. Exactly when the ambient von Neu...

MTL-algebras are algebraic structures for the Esteva-Godo monoidal tnorm based logic (MTL), a many-valued propositional calculus that formalizes the structure of the real interval [0, 1], induced by a left-continuous t-norm. Given a complete MTL-algebra X , we define the weak forcing value |φ|X and the forcing value [φ]X , for any formula φ of MTL in X . We establish some arithmetical propertie...

In functional analysis, approximative properties of an object become precise in its ultrapower. We discuss this idea and its consequences for automorphisms of II1 factors. Here are some sample results: (1) an automorphism is approximately inner if and only if its ultrapower is א0-locally inner; (2) the ultrapower of an outer automorphism is always outer; (3) for unital *-homomorphisms from a se...

it is shown that every  almost linear bijection $h : arightarrow b$ of a unital $c^*$-algebra $a$ onto a unital$c^*$-algebra $b$ is a $c^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in a$, all $y in a$, and all $nin mathbb z$, andthat almost linear continuous bijection $h : a rightarrow b$ of aunital $c^*$-algebra $a$ of real rank zero onto a unital$c^*$-algebra...