Evaluation is MSOL-compatible
نویسندگان
چکیده
We consider simply-typed lambda calculus with fixpoint operators. Evaluation of a term gives as a result the Böhm tree of the term. We show that evaluation is compatible with monadic secondorder logic (MSOL). This means that for a fixed finite vocabulary of terms, the MSOL properties of Böhm trees of terms are effectively MSOL properties of terms themselves. Theorems of this kind have been known for some graph operations: unfolding, and Muchnik iteration. Similarly to those results, our main theorem has diverse applications. It can be used to show decidability results, to construct classes of graphs with decidable MSOL theory, or to obtain MSOL formulas expressing behavioral properties of terms. Another application is decidability of a control-flow
منابع مشابه
Evaluation and algebraic recongnizability
Over words or trees, recognizability is equivalent to definability in monadic second-order logic. For this reason, in a context where algebraic foundations are not settled, MSOL takes the role of the expressivity yardstick. In our quest for algebraic understanding of tree languages the main question is what should be the set of basic operators. Forest algebras [BW07] give one possible answer: c...
متن کاملConnection Matrices for MSOL-Definable Structural Invariants
Connection matrices of graph parameters were first introduced by M. Freedman, L. Lovász and A. Schrijver (2007) to study the question which graph parameters can be represented as counting functions of weighted homomorphisms. The rows and columns of a connection matrix M(f, ) of a graph parameter f and a binary operation are indexed by all finite (labeled) graphs Gi and the entry at (Gi, Gj) is ...
متن کاملAlgorithmic uses of the Feferman-Vaught Theorem
The classical Feferman–Vaught Theorem for First Order Logic explains how to compute the truth value of a 5rst order sentence in a generalized product of 5rst order structures by reducing this computation to the computation of truth values of other 5rst order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by L8...
متن کاملMonadic Second Order Logic on Tree-Like Structures
An operation M∗ which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such tree-like structures is defined. It is shown that automata of this kind characterise expressive power of monadic second-order logic (MSOL) over tree-like structures. Using this characterisation it is pr...
متن کاملHankel Matrices: From Words to Graphs
We survey recent work on the use of Hankel matrices H(f,2) for real-valued graph parameters f and a binary sum-like operation 2 on labeled graphs such as the disjoint union and various gluing operations of pairs of laeled graphs. Special cases deal with real-valued word functions. We start with graph parameters definable in Monadic Second Order Logic MSOL and show how MSOL-definability can be r...
متن کامل