Arthur F. Ramos

Orcid: 0009-0003-3568-0325

According to our database1, Arthur F. Ramos authored at least 28 papers between 2014 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Certified Qualitative Analysis of the SIR ODE and Reusable Scalar Lemmas in Isabelle/HOL.
CoRR, May, 2026

Stokes' Theorem for Smooth Singular Cubes in Lean 4: True Pullback, Bridges to mathlib4, and Chain-Level d^2=0.
CoRR, May, 2026

Recursive Completion in Higher K-Models: Front-Seed Semantics, Proof-Relevant Witnesses, and the K-Infinity Model.
CoRR, April, 2026

Token-Sensitive Enclosure Semantics for Measurement-Bearing Expressions.
CoRR, April, 2026

A Prime-Generated Formalization of Nagata's Factoriality Theorem in Lean 4.
CoRR, April, 2026

Alon's Combinatorial Nullstellensatz.
Arch. Formal Proofs, 2026

The Mostowski Collapse Theorem.
Arch. Formal Proofs, 2026

Andrew's Monotone Chain Convex Hull Algorithm.
Arch. Formal Proofs, 2026

Nash Equilibria for Finite Games in Isabelle/HOL.
Arch. Formal Proofs, 2026

The Banach-Tarski Paradox in Isabelle/HOL.
Arch. Formal Proofs, 2026

Aho-Corasick String Matching.
Arch. Formal Proofs, 2026

Nagata Factoriality.
Arch. Formal Proofs, 2026

2025
A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums.
CoRR, December, 2025

The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups.
CoRR, December, 2025

Computational Paths Form a Weak ω-Groupoid.
CoRR, December, 2025

Formalizing Computational Paths and Fundamental Groups in Lean.
CoRR, November, 2025

Computational paths - a weak groupoid.
J. Log. Comput., 2025

2020
Computational Paths - A Weak Groupoid.
CoRR, 2020

2019
An alternative approach to the calculation of fundamental groups based on labeled natural deduction.
CoRR, 2019

A Topological Application of Labelled Natural Deduction.
CoRR, 2019

Explicit Computational Paths in Type Theory.
Bull. Symb. Log., 2019

2018
On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths.
CoRR, 2018

On the Use of Computational Paths in Path Spaces of Homotopy Type Theory.
CoRR, 2018

2017
On the identity type as the type of computational paths.
Log. J. IGPL, 2017

2016
Computational Paths and Identity Types.
CoRR, 2016

2015
On Computational Paths and the Fundamental Groupoid of a Type.
CoRR, 2015

On the Groupoid Model of Computational Paths.
CoRR, 2015

2014
Sequences of Rewrites: A Categorical Interpretation.
CoRR, 2014


  Loading...