Cover Image

Formalizing Computational Paths and Fundamental Groups in Lean

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ramos, Arthur F., de Oliveira, Anjolina G., de Queiroz, Ruy J. G. B., de Veras, Tiago M. L.
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory 03B35, 55Q05, 68T01 F.4.1; I.2.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups
by: Ramos, Arthur F., et al.
Published: (2025)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

Implicit automata in λ-calculi III: affine planar string-to-string functions
by: Pradic, Cécilia, et al.
Published: (2024)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

Probabilistic automatic complexity of finite strings
by: Gill, Kenneth
Published: (2024)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
by: Alpay, Faruk, et al.
Published: (2026)

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Multidimensional tilings and MSO logic
by: Pallen, Rémi, et al.
Published: (2025)

The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Recursive Completion in Higher K-Models: Front-Seed Semantics, Proof-Relevant Witnesses, and the K-Infinity Model
by: Martinez-Rivillas, Daniel O., et al.
Published: (2026)

Finite-Horizon First-Order Rank Profiles of Regular Languages
by: Bazarova, Madina, et al.
Published: (2026)

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

A vector logic for intensional formal semantics
by: Quigley, Daniel
Published: (2026)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

On the Intersection Problem for Quantum Finite Automata
by: Benso, Andrea, et al.
Published: (2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

On the topology of concurrent systems
by: Faustino, Catarina, et al.
Published: (2024)

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
by: Casares, Antonio, et al.
Published: (2025)

Flavors of Quantifiers in Hyperlogics
by: Chalupa, Marek, et al.
Published: (2025)

Layered automata: A canonical model for automata over infinite words
by: Casares, Antonio, et al.
Published: (2026)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
by: Casares, Antonio, et al.
Published: (2024)

Transition-based vs stated-based acceptance for automata over infinite words
by: Casares, Antonio
Published: (2025)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
by: Casares, Antonio, et al.
Published: (2023)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

The generating power of weighted tree automata with initial algebra semantics
by: Droste, Manfred, et al.
Published: (2024)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)