A theory of structural stationarity in theπ-Calculus
✍ Scribed by Roland Meyer
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 875 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Starting from the -nets de ned by Milner, we present a graphical formalism called faithful -nets. The aim of these nets is to provide a graphical form to the systems with dynamically changing con gurations. The faithful -nets correspond precisely to the -calculus. The paper gives two fully abstract
## Abstract We investigate stationarity of types over models in simple theories. In particular, we show that in simple theories with finite SU‐rank, any complete type over a model having Cantor‐Bendixson rank is stationary. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
The calculus of structures is a new proof theoretical formalism, like natural deduction, the sequent calculus and proof nets, for specifying logical systems syntactically. In a rule in the calculus of structures, the premise as well as the conclusion are structures, which are expressions that share