Mockingbird lattices

by   Samuele Giraudo, et al.

We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator M. This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule M x_1 → x_1 x_1. We prove that the reflexive and transitive closure of this rewrite relation is a partial order on terms on M and that all connected components of its rewrite graph are Hasse diagrams of lattices. This last result is based on the introduction of lattices on some forests. We enumerate the elements, the edges of the Hasse diagrams, and the intervals of these lattices with the help of formal power series on terms and on forests.


page 1

page 2

page 3

page 4


The combinator M and the Mockingbird lattice

We study combinatorial and order theoretic structures arising from the f...

Order-theoretic trees: monadic second-order descriptions and regularity

An order-theoretic forest is a countable partial order such that the set...

Conditional Path Analysis in Singly-Connected Path Diagrams

We extend the classical path analysis by showing that, for a singly-conn...

Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)

We introduce a novel automata model, called pebble-intervals automata (P...

Drawing Order Diagrams Through Two-Dimension Extension

Order diagrams are an important tool to visualize the complex structure ...

Folding and Unfolding on Metagraphs

Typed metagraphs are defined as hypergraphs with types assigned to hyper...

Collaboration vs. choreography conformance in BPMN

The BPMN 2.0 standard is a widely used semi-formal notation to model fro...