Relational semantics of linear logic and higher-order model-checking

In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of any higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreover, the interaction between the relational interpretations of the HORS and of the ATA identifies the set of accepting states of the tree automaton against the infinite tree generated by the recursion scheme. We show how to extend this result to alternating parity automata (APT) by introducing a parametric version of the exponential modality of linear logic, capturing the formal properties of colors (or priorities) in higher-order model-checking. We show in particular how to reunderstand in this way the type-theoretic approach to higher-order model-checking developed by Kobayashi and Ong. We briefly explain in the end of the paper how his analysis driven by linear logic results in a new and purely semantic proof of decidability of the formulas of the monadic second-order logic for higher-order recursion schemes.Comment: 24 pages. Submitte

Unifying Structured Recursion Schemes

AbstractFolds and unfolds have been understood as fundamental building blocks for total programming, and have been extended to form an entire zoo of specialised structured recursion schemes. A great number of these schemes were unified by the introduction of adjoint folds, but more exotic beasts such as recursion schemes from comonads proved to be elusive. In this paper, we show how the two canonical derivations of adjunctions from (co)monads yield recursion schemes of significant computational importance: monadic catamorphisms come from the Kleisli construction, and more astonishingly, the elusive recursion schemes from comonads come from the Eilenberg–Moore construction. Thus, we demonstrate that adjoint folds are more unifying than previously believed.</jats:p

Symmetric coupling of angular momenta, quadratic algebras and discrete polynomials

Eigenvalues and eigenfunctions of the volume operator, associated with the symmetric coupling of three SU(2) angular momentum operators, can be analyzed on the basis of a discrete Schroedinger-like equation which provides a semiclassical Hamiltonian picture of the evolution of a `quantum of space', as shown by the authors in a recent paper. Emphasis is given here to the formalization in terms of a quadratic symmetry algebra and its automorphism group. This view is related to the Askey scheme, the hierarchical structure which includes all hypergeometric polynomials of one (discrete or continuous) variable. Key tool for this comparative analysis is the duality operation defined on the generators of the quadratic algebra and suitably extended to the various families of overlap functions (generalized recoupling coefficients). These families, recognized as lying at the top level of the Askey scheme, are classified and a few limiting cases are addressed.Comment: 10 pages, talk given at "Physics and Mathematics of Nonlinear Phenomena" (PMNP2013), to appear in J. Phys. Conf. Serie

Proof-irrelevant model of CC with predicative induction and judgmental equality

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding which is universally defined for any function type, regardless of being impredicative. Direct and concrete interpretations of simultaneous induction and mutually recursive functions are also provided by extending Dybjer's interpretations on the basis of Aczel's rule sets. Our model can be regarded as a higher-order generalization of the truth-table methods. We provide a relatively simple consistency proof of type theory, which can be used as the basis for a theorem prover

Quantum states of elementary three-geometry

We introduce a quantum volume operator $K$ in three--dimensional Quantum Gravity by taking into account a symmetrical coupling scheme of three SU(2) angular momenta. The spectrum of $K$ is discrete and defines a complete set of eigenvectors which is alternative with respect to the complete sets employed when the usual binary coupling schemes of angular momenta are considered. Each of these states, that we call quantum bubbles, represents an interference of extended configurations which provides a rigorous meaning to the heuristic notion of quantum tetrahedron. We study the generalized recoupling coefficients connecting the symmetrical and the binary basis vectors, and provide an explicit recursive solution for such coefficients by analyzing also its asymptotic limit.Comment: 15 pages, LaTe

Quantum and Classical Aspects of Deformed c=1c=1 Strings.

The quantum and classical aspects of a deformed $c=1$ matrix model proposed by Jevicki and Yoneya are studied. String equations are formulated in the framework of Toda lattice hierarchy. The Whittaker functions now play the role of generalized Airy functions in $c<1$ strings. This matrix model has two distinct parameters. Identification of the string coupling constant is thereby not unique, and leads to several different perturbative interpretations of this model as a string theory. Two such possible interpretations are examined. In both cases, the classical limit of the string equations, which turns out to give a formal solution of Polchinski's scattering equations, shows that the classical scattering amplitudes of massless tachyons are insensitive to deformations of the parameters in the matrix model.Comment: 52 pages, Latex

Relational Semantics of Linear Logic and Higher-order Model Checking

In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of any higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreover, the interaction between the relational interpretations of the HORS and of the ATA identifies the set of accepting states of the tree automaton against the infinite tree generated by the recursion scheme. We show how to extend this result to alternating parity automata (APT) by introducing a parametric version of the exponential modality of linear logic, capturing the formal properties of colors (or priorities) in higher-order model-checking. We show in particular how to reunderstand in this way the type-theoretic approach to higher-order model-checking developed by Kobayashi and Ong. We briefly explain in the end of the paper how this analysis driven by linear logic results in a new and purely semantic proof of decidability of the formulas of the monadic second-order logic for higher-order recursion schemes

Changing a semantics: opportunism or courage?

The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic. Even so, discussion has persisted about their technical status, and perhaps even their conceptual legitimacy. This paper gives a systematic view of generalized model techniques, discusses what they mean in mathematical and philosophical terms, and presents a few technical themes and results about their role in algebraic representation, calibrating provability, lowering complexity, understanding fixed-point logics, and achieving set-theoretic absoluteness. We also show how thinking about Henkin's approach to semantics of logical systems in this generality can yield new results, dispelling the impression of adhocness. This paper is dedicated to Leon Henkin, a deep logician who has changed the way we all work, while also being an always open, modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and Alonso, E., 201