Mockingbird lattices

04/06/2022
by   Samuele Giraudo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2022

The combinator M and the Mockingbird lattice

We study combinatorial and order theoretic structures arising from the f...
research
05/15/2023

An Introduction to String Diagrams for Computer Scientists

This document is an elementary introduction to string diagrams. It takes...
research
11/07/2021

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

An order-theoretic forest is a countable partial order such that the set...
research
02/12/2020

Conditional Path Analysis in Singly-Connected Path Diagrams

We extend the classical path analysis by showing that, for a singly-conn...
research
06/14/2019

Drawing Order Diagrams Through Two-Dimension Extension

Order diagrams are an important tool to visualize the complex structure ...
research
12/03/2020

Folding and Unfolding on Metagraphs

Typed metagraphs are defined as hypergraphs with types assigned to hyper...
research
06/19/2023

Scalable Probabilistic Routes

Inference and prediction of routes have become of interest over the past...

Please sign up or login with your details

Forgot password? Click here to reset