An Explicit Framework for Interaction Nets

Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on elementary properties of graph theory. We give here a more explicit presentation based on notions borrowed from Girard's Geometry of Interaction: interaction nets are presented as partial permutations and a composition of nets, the gluing, is derived from the execution formula. We then define contexts and reduction as the context closure of rules. We prove strong confluence of the reduction within our framework and show how interaction nets can be viewed as the quotient of some generalized proof-nets

Modal Logics of Topological Relations

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the Egenhofer-Franzosa (or RCC8) relations between regions in topological spaces such as the real plane. We investigate the expressive power and computational complexity of logics obtained in this way. It turns out that our modal logics have the same expressive power as the two-variable fragment of first-order logic, but are exponentially less succinct. The complexity ranges from (undecidable and) recursively enumerable to highly undecidable, where the recursively enumerable logics are obtained by considering substructures of structures induced by topological spaces. As our undecidability results also capture logics based on the real line, they improve upon undecidability results for interval temporal logics by Halpern and Shoham. We also analyze modal logics based on the five RCC5 relations, with similar results regarding the expressive power, but weaker results regarding the complexity

Composition with Target Constraints

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.Comment: This paper is an extended version of: M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. In 13th International Conference on Database Theory (ICDT), pages 129-142, 201

A dependent nominal type theory

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type theories. We present a LF-style dependent type theory extended with name-abstraction types, prove soundness and decidability of beta-eta-equivalence checking, discuss adequacy and canonical forms via an example, and discuss extensions such as dependently-typed recursion and induction principles

Probing Quantum Gravity Through Exactly Soluble Midi-Superspaces I

It is well-known that the Einstein-Rosen solutions to the 3+1 dimensional vacuum Einstein's equations are in one to one correspondence with solutions of 2+1 dimensional general relativity coupled to axi-symmetric, zero rest mass scalar fields. We first re-examine the quanization of this midi-superspace paying special attention to the asymptotically flat boundary conditions and to certain functional analytic subtleties associated with regularization. We then use the resulting quantum theory to analyze several conceptual and technical issues of quantum gravity.Comment: 28 pages, late

Nonabelian Fields in Exact String Solutions

Within the framework of "anomalously gauged" Wess-Zumino-Witten (WZW) models, we construct solutions which include nonabelian fields. Both compact and noncompact groups are discussed. In the case of compact groups, as an example of background containing nonabelian fields, we discuss conformal theory on the $SO(4)/SO(3)$ coset, which is the natural generalization of the 2D monopole theory corresponding to the $SO(3)/SO(2)$ coset. In noncompact case, we consider examples with $SO(2,1)/SO(1,1)$ and $SO(3,2)/SO(3,1)$ cosets.Comment: 15 pages, Late

Microfluidic multiscale model of transport phenomena for engineering and interdisciplinary education applied to elements of a stirling engine

This paper was presented at the 4th Micro and Nano Flows Conference (MNF2014), which was held at University College, London, UK. The conference was organised by Brunel University and supported by the Italian Union of Thermofluiddynamics, IPEM, the Process Intensification Network, the Institution of Mechanical Engineers, the Heat Transfer Society, HEXAG - the Heat Exchange Action Group, and the Energy Institute, ASME Press, LCN London Centre for Nanotechnology, UCL University College London, UCL Engineering, the International NanoScience Community, www.nanopaprika.eu.Microfluidic model based on elementary mathematical tools and basic corpuscular physics is applied to flow configurations simulating the Stirling engine. Universality and mathematical simplicity of the model is main objective of its development. This to facilitate its application not only in micro and standard macro, single- and multiphase flows in engineering but in biology, medicine and interdisciplinary sciences as well. As dynamics of disperse systems it promotes the common physical background of multiple, apparently unrelated phenomena. Main feature of the method - compared with standard methods - is departure from differential notation where possible to ensure suitability for analysis of discontinuous systems. Physical quantities are determined directly at required scale by choice of reference volumes/surfaces and use of the mean value theorem (MVT) of integral calculus where required. Thus the method is applicable to discrete particles and avoids higher order requirements of Navier-Stokes solutions. Besides saving one integration step it generally facilitates the analysis considerably. Newton’s second law is used explicitly as single equation of motion. Together with conservation laws it is applied to non-relativistic motion of particle systems in range from individual particles, atoms, molecules or even electrons, over to macroscopic particle sets in solid or flowing systems of traditional mechanics, up to celestial bodies of classical astro-physics. The basically microfluidic model was used to derive all definitions and equations of standard continuum fluid mechanics and multiphase flows. Compared with standard methods the here used model has the singular ability to describe consistently all phenomena related to one of most inspiring technical devices: to Stirling engine

Propositional Dynamic Logic for Message-Passing Systems

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problem for CFMs and HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with intersection, the semantics of a formula cannot be captured by a CFM anymore