AQFT from n-functorial QFT

There are essentially two different approaches to the axiomatization of quantum field theory (QFT): algebraic QFT, going back to Haag and Kastler, and functorial QFT, going back to Atiyah and Segal. More recently, based on ideas by Baez and Dolan, the latter is being refined to "extended" functorial QFT by Freed, Hopkins, Lurie and others. The first approach uses local nets of operator algebras which assign to each patch an algebra "of observables", the latter uses n-functors which assign to each patch a "propagator of states". In this note we present an observation about how these two axiom systems are naturally related: we demonstrate under mild assumptions that every 2-dimensional extended Minkowskian QFT 2-functor ("parallel surface transport") naturally yields a local net. This is obtained by postcomposing the propagation 2-functor with an operation that mimics the passage from the Schroedinger picture to the Heisenberg picture in quantum mechanics. The argument has a straightforward generalization to general pseudo-Riemannian structure and higher dimensions.Comment: 39 pages; further examples added: Hopf spin chains and asymptotic inclusion of subfactors; references adde

Convergence and quantale-enriched categories

Generalising Nachbin's theory of "topology and order", in this paper we continue the study of quantale-enriched categories equipped with a compact Hausdorff topology. We compare these $\mathcal{V}$-categorical compact Hausdorff spaces with ultrafilter-quantale-enriched categories, and show that the presence of a compact Hausdorff topology guarantees Cauchy completeness and (suitably defined) codirected completeness of the underlying quantale enriched category

Łukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems

A novel approach to self-organizing, highly-complex systems (HCS), such as living organisms and artificial intelligent systems (AIs), is presented which is relevant to Cognition, Medical Bioinformatics and Computational Neuroscience. Quantum Automata (QAs) were defined in our previous work as generalized, probabilistic automata with quantum state spaces (Baianu, 1971). Their next-state functions operate through transitions between quantum states defined by the quantum equations of motion in the Schroedinger representation, with both initial and boundary conditions in space-time. Such quantum automata operate with a quantum logic, or Q-logic, significantly different from either Boolean or Łukasiewicz many-valued logic. A new theorem is proposed which states that the category of quantum automata and automata--homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines) are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R)--Systems which are open, dynamic biosystem networks with defined biological relations that represent physiological functions of primordial organisms, single cells and higher organisms