Image de couverture de livre

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Fang, Wenjie
Format:	Preprint
Publié:	2022
Sujets:	Combinatorics Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the complexity of normalization for the planar $λ$-calculus
par: Das, Anupam, et autres
Publié: (2024)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

Capturing properties of planar diagrams in Lean proof assistant software
par: Litterick, Alastair, et autres
Publié: (2025)

Indivisibility and uniform computational strength
par: Gill, Kenneth
Publié: (2023)

Decomposing graphs into stable and ordered parts
par: Buffière, Hector, et autres
Publié: (2025)

Monadic Second-Order Logic of Permutations
par: Jelínek, Vít, et autres
Publié: (2025)

Decidability for Sturmian words
par: Hieronymi, Philipp, et autres
Publié: (2021)

Bijective proofs for Eulerian numbers of types B and D
par: Santocanale, Luigi
Publié: (2021)

A very sharp threshold for first order logic distinguishability of random graphs
par: Benjamini, Itai, et autres
Publié: (2022)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
par: Brakensiek, Joshua, et autres
Publié: (2026)

Tutte's theorem as an educational formalization project
par: Otte, Pim
Publié: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
par: Adam-Day, Sam, et autres
Publié: (2025)

Two variable logic with ultimately periodic counting
par: Benedikt, Michael, et autres
Publié: (2020)

Further Comments on Yablo's Construction
par: Schlechta, Karl
Publié: (2025)

Local structure of idempotent algebras II
par: Bulatov, Andrei A.
Publié: (2020)

Additive systems for $\mathbb{Z}$ are undecidable
par: Zabolotskii, Andrei
Publié: (2025)

On Planarity of Graphs in Homotopy Type Theory
par: Prieto-Cubides, Jonathan, et autres
Publié: (2021)

Transductions of Graph Classes Admitting Product Structure
par: Hliněný, Petr, et autres
Publié: (2025)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
par: Dvorak, Martin, et autres
Publié: (2025)

A Formal Proof of R(4,5)=25
par: Gauthier, Thibault, et autres
Publié: (2024)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
par: Hliněný, Petr, et autres
Publié: (2025)

Happy Ending: An Empty Hexagon in Every Set of 30 Points
par: Heule, Marijn J. H., et autres
Publié: (2024)

The unstable formula theorem revisited via algorithms
par: Malliaris, Maryanthe, et autres
Publié: (2022)

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

The domino problem is decidable for robust tilesets
par: Aubrun, Nathalie, et autres
Publié: (2024)

Finding descending sequences through ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2020)

The weakness of finding descending sequences in ill-founded linear orders
par: Goh, Jun Le, et autres
Publié: (2024)

First-order logic axiomatization of metric graph theory
par: Chalopin, Jérémie, et autres
Publié: (2022)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

An Introduction to Razborov's Flag Algebra as a Proof System for Extremal Graph Theory
par: Jeong, Gyeongwon, et autres
Publié: (2026)