default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur F. Ramos
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j21]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Nagata Factoriality. Arch. Formal Proofs 2026 (2026)- [j20]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Aho-Corasick String Matching. Arch. Formal Proofs 2026 (2026) - [j19]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
The Banach-Tarski Paradox in Isabelle/HOL. Arch. Formal Proofs 2026 (2026) - [j18]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Nash Equilibria for Finite Games in Isabelle/HOL. Arch. Formal Proofs 2026 (2026) - [j17]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Andrew's Monotone Chain Convex Hull Algorithm. Arch. Formal Proofs 2026 (2026) - [j16]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
The Mostowski Collapse Theorem. Arch. Formal Proofs 2026 (2026) - [j15]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Erdos-Ginzburg-Ziv. Arch. Formal Proofs 2026 (2026) - [j14]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
The Classical Seifert-van Kampen Theorem. Arch. Formal Proofs 2026 (2026) - [j13]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
A Reusable Isabelle/HOL Framework for Propositional Labelled Natural Deduction. Arch. Formal Proofs 2026 (2026) - [j12]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
The Busy Beaver Function. Arch. Formal Proofs 2026 (2026) - [j11]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Vosper's Theorem and the Cauchy-Davenport Theorem via the Polynomial Method. Arch. Formal Proofs 2026 (2026) - [j10]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Freiman's 3k - 4 Theorem. Arch. Formal Proofs 2026 (2026) - [j9]Arthur Freitas Ramos, David B. Hulak, Ruy José Guerra Barretto de Queiroz:
Correctness and Complexity of BMSSP in Isabelle/HOL. Arch. Formal Proofs 2026 (2026) - [j8]Arthur Freitas Ramos, David B. Hulak, Ruy J. G. B. de Queiroz:
Conway's Circle Theorem in Isabelle/HOL. Arch. Formal Proofs 2026 (2026) - [j7]Arthur Freitas Ramos, David B. Hulak, Ruy J. G. B. de Queiroz:
The Chevalley-Warning Theorem. Arch. Formal Proofs 2026 (2026) - [j6]Arthur Freitas Ramos, David B. Hulak, Ruy J. G. B. de Queiroz:
Checking Equality-Saturation Merge and Extraction Certificates. Arch. Formal Proofs 2026 (2026) - [j5]Arthur Freitas Ramos, David B. Hulak, Ruy J. G. B. de Queiroz:
Formal Verification of an Explicit Counterexample to the Jacobian Conjecture. Arch. Formal Proofs 2026 (2026) - [j4]Arthur Freitas Ramos, Ruy José Guerra Barretto de Queiroz, David B. Hulak:
Alon's Combinatorial Nullstellensatz. Arch. Formal Proofs 2026 (2026) - [i19]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
A Prime-Generated Formalization of Nagata's Factoriality Theorem in Lean 4. CoRR abs/2604.05238 (2026) - [i18]David B. Hulak
, Arthur F. Ramos, Ruy J. G. B. de Queiroz:
Token-Sensitive Enclosure Semantics for Measurement-Bearing Expressions. CoRR abs/2604.07626 (2026) - [i17]Daniel O. Martínez-Rivillas, Arthur F. Ramos, Ruy J. G. B. de Queiroz:
Recursive Completion in Higher K-Models: Front-Seed Semantics, Proof-Relevant Witnesses, and the K-Infinity Model. CoRR abs/2604.12981 (2026) - [i16]David B. Hulak, Arthur F. Ramos, Ruy J. G. B. de Queiroz:
Stokes' Theorem for Smooth Singular Cubes in Lean 4: True Pullback, Bridges to mathlib4, and Chain-Level d^2=0. CoRR abs/2605.01028 (2026) - [i15]David B. Hulak, Arthur F. Ramos, Ruy J. G. B. de Queiroz:
Certified Qualitative Analysis of the SIR ODE and Reusable Scalar Lemmas in Isabelle/HOL. CoRR abs/2605.02474 (2026) - 2025
- [j3]Tiago M. L. de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
Computational paths - a weak groupoid. J. Log. Comput. 35(5) (2025) - [i14]Arthur F. Ramos, Anjolina Grisi de Oliveira, Ruy J. G. B. de Queiroz, Tiago M. L. de Veras:
Formalizing Computational Paths and Fundamental Groups in Lean. CoRR abs/2511.19142 (2025) - [i13]Arthur F. Ramos, Tiago M. L. de Veras, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
Computational Paths Form a Weak ω-Groupoid. CoRR abs/2512.00657 (2025) - [i12]Arthur F. Ramos, Tiago Mendonça Lucena de Veras, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups. CoRR abs/2512.03175 (2025) - [i11]Arthur F. Ramos, Anjolina Grisi de Oliveira, Ruy J. G. B. de Queiroz, Tiago Mendonça Lucena de Veras:
A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums. CoRR abs/2512.09280 (2025) - 2020
- [i10]Tiago M. L. de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Thiago D. O. Silva, Anjolina Grisi de Oliveira:
Computational Paths - A Weak Groupoid. CoRR abs/2007.07769 (2020)
2010 – 2019
- 2019
- [j2]Arthur Freitas Ramos:
Explicit Computational Paths in Type Theory. Bull. Symb. Log. 25(2): 213-214 (2019) - [i9]Tiago Mendonça Lucena de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
A Topological Application of Labelled Natural Deduction. CoRR abs/1906.09105 (2019) - [i8]Tiago Mendonça Lucena de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
An alternative approach to the calculation of fundamental groups based on labeled natural deduction. CoRR abs/1906.09107 (2019) - 2018
- [i7]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira, Tiago Mendonça Lucena de Veras:
On the Use of Computational Paths in Path Spaces of Homotopy Type Theory. CoRR abs/1803.01709 (2018) - [i6]Tiago Mendonça Lucena de Veras, Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths. CoRR abs/1804.01413 (2018) - 2017
- [j1]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
On the identity type as the type of computational paths. Log. J. IGPL 25(4): 562-584 (2017) - 2016
- [i5]Arthur Freitas Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
Computational Paths and Identity Types. CoRR abs/1609.05079 (2016) - 2015
- [i4]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
On the Identity Type as the Type of Computational Paths. CoRR abs/1504.04759 (2015) - [i3]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
On the Groupoid Model of Computational Paths. CoRR abs/1506.02721 (2015) - [i2]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
On Computational Paths and the Fundamental Groupoid of a Type. CoRR abs/1509.06429 (2015) - 2014
- [i1]Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira:
Sequences of Rewrites: A Categorical Interpretation. CoRR abs/1412.2105 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-30 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
