No description available.

Wir betrachten eine Reihe von Trivialitäts- resultaten und No-Go-Theoremen aus der Axiomatischen Quantenfeldtheorie. Von besonderem Interesse ist Haags Theorem. Im Wesentlichen sagt es aus, dass der unitäre Intertwiner des Wechselwirkungsbildes nicht existiert oder trivial ist. Als wichtigste Voraussetzung von Haags Theorem arbeiten wir die unitäre Äquivalenz heraus und unterziehen die kanonische Störungstheorie skalarer Felder einer Kritik um zu argumentieren, dass die kanonisch renormierte Quantenfeldtheorie Haags Theorem umgeht, da sie genau diese Bedingung nicht erfüllt. Der Hopfalgebraische Zugang zur perturbativen Quantenfeldtheorie bietet die Möglichkeit, Dyson-Schwinger-und Renormierungsgruppengleichungen mathematisch sauber herzuleiten, wenn auch mit rein kombinatorischem Ausgangspunkt. Wir präsentieren eine Beschreibung dieser Methode und diskutieren eine gewöhnliche Differentialgleichung für die anomale Dimension des Photons. Eine Spielzeugmodellversion dieser Gleichung lässt sich exakt lösen; ihre Lösung weist eine interessante nichtstörunsgtheoretische Eigenschaft auf, deren Auswirkungen auf die laufende Kopplung und die Selbstenergie des Photons wir untersuchen. Solche nichtperturbativen Beiträge mögen die Existenz eines Landau-Pols ausschliessen, ein Sachverhalt, den wir ebenfalls diskutieren. Unter der Arbeitshypothese, dass die anomale Dimension eines Quantenfeldes in die Klasse der resurgenten Funktionen fällt, studieren wir, welche Bedingungen die Dyson-Schwinger-und Renormierungsgruppengleichungen an ihre Transreihe stellen. Wir stellen fest, dass diese unter bestimmten Bedingungen kodieren, wie der perturbative Sektor den nichtperturbativen vollständig determiniert. / We review a package of triviality results and no-go theorems in axiomatic quantum field theory. Of particular interest is Haag''s theorem. It essentially says that the unitary intertwiner of the interaction picture does not exist unless it is trivial. We single out unitary equivalence as the most salient provision of Haag''s theorem and critique canonical perturbation theory for scalar fields to argue that canonically renormalised quantum field theory bypasses Haag''s theorem by violating this very assumption. The Hopf-algebraic approach to perturbative quantum field theory allows us to derive Dyson-Schwinger equations and the Callan-Symanzik equation in a mathematically sound way, albeit starting with a purely combinatorial setting. We present a pedagogical account of this method and discuss an ordinary differential equation for the anomalous dimension of the photon. A toy model version of this equation can be solved exactly; its solution exhibits an interesting nonperturbative feature whose effect on the running coupling and the self-energy of the photon we investigate. Such nonperturbative contributions may exclude the existence of a Landau pole, an issue that we also discuss. On the working hypothesis that the anomalous dimension of a quantum field falls into the class of resurgent functions, we study what conditions Dyson-Schwinger and renormalisation group equations impose on its resurgent transseries. We find that under certain conditions, they encode how the perturbative sector determines the nonperturbative one completely.

Ulm, Univ., Diss., 2007.

No description available.

The capability of changing beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. Belief change therefore is one of the central research fields in Artificial Intelligence (AI) for over two decades. In the AI literature, two different kinds of belief change operations have been intensively investigated: belief update, which deal with situations where the new information describes changes of the world; and belief revision, which assumes the world is static. As another important research area in AI, reasoning about actions mainly studies the problem of representing and reasoning about effects of actions. These two research fields are closely related and apply a common underlying principle, that is, an agent should change its beliefs (knowledge) as little as possible whenever an adjustment is necessary. This lays down the possibility of reusing the ideas and results of one field in the other, and vice verse. This thesis aims to develop a general framework and devise computational models that are applicable in reasoning about actions. Firstly, I shall propose a new framework for iterated belief revision by introducing a new postulate to the existing AGM/DP postulates, which provides general criteria for the design of iterated revision operators. Secondly, based on the new framework, a concrete iterated revision operator is devised. The semantic model of the operator gives nice intuitions and helps to show its satisfiability of desirable postulates. I also show that the computational model of the operator is almost optimal in time and space-complexity. In order to deal with the belief change problem in multi-agent systems, I introduce a concept of mutual belief revision which is concerned with information exchange among agents. A concrete mutual revision operator is devised by generalizing the iterated revision operator. Likewise, a semantic model is used to show the intuition and many nice properties of the mutual revision operator, and the complexity of its computational model is formally analyzed. Finally, I present a belief update operator, which takes into account two important problems of reasoning about action, i.e., disjunctive updates and domain constraints. Again, the updated operator is presented with both a semantic model and a computational model.

The capability of changing beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. Belief change therefore is one of the central research fields in Artificial Intelligence (AI) for over two decades. In the AI literature, two different kinds of belief change operations have been intensively investigated: belief update, which deal with situations where the new information describes changes of the world; and belief revision, which assumes the world is static. As another important research area in AI, reasoning about actions mainly studies the problem of representing and reasoning about effects of actions. These two research fields are closely related and apply a common underlying principle, that is, an agent should change its beliefs (knowledge) as little as possible whenever an adjustment is necessary. This lays down the possibility of reusing the ideas and results of one field in the other, and vice verse. This thesis aims to develop a general framework and devise computational models that are applicable in reasoning about actions. Firstly, I shall propose a new framework for iterated belief revision by introducing a new postulate to the existing AGM/DP postulates, which provides general criteria for the design of iterated revision operators. Secondly, based on the new framework, a concrete iterated revision operator is devised. The semantic model of the operator gives nice intuitions and helps to show its satisfiability of desirable postulates. I also show that the computational model of the operator is almost optimal in time and space-complexity. In order to deal with the belief change problem in multi-agent systems, I introduce a concept of mutual belief revision which is concerned with information exchange among agents. A concrete mutual revision operator is devised by generalizing the iterated revision operator. Likewise, a semantic model is used to show the intuition and many nice properties of the mutual revision operator, and the complexity of its computational model is formally analyzed. Finally, I present a belief update operator, which takes into account two important problems of reasoning about action, i.e., disjunctive updates and domain constraints. Again, the updated operator is presented with both a semantic model and a computational model.