Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Carneiro
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation (former): Ohio State University, Department of Mathematics, Columbus OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Mario Carneiro:
Lean4Lean: Towards a formalized metatheory for the Lean theorem prover. CoRR abs/2403.14064 (2024)- [i10]Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio, Cayden R. Codel, Mario Carneiro, Marijn J. H. Heule:
Formal Verification of the Empty Hexagon Number. CoRR abs/2403.17370 (2024) - 2023
- [c8]Mario Carneiro, Chad E. Brown, Josef Urban:
Automated Theorem Proving for Metamath. ITP 2023: 9:1-9:19 - [c7]Mario Carneiro:
Reimplementing Mizar in Rust. ITP 2023: 10:1-10:18 - [i9]Mario Carneiro:
Reimplementing Mizar in Rust. CoRR abs/2304.08391 (2023) - 2022
- [j3]Mario Carneiro
:
The Divergence of the Sum of Prime Reciprocals. Formaliz. Math. 30(3): 209-210 (2022) - [j2]Seulkee Baek, Mario Carneiro, Marijn J. H. Heule:
A Flexible Proof Format for SAT Solver-Elaborator Communication. Log. Methods Comput. Sci. 18(2) (2022) - 2021
- [c6]Seulkee Baek, Mario Carneiro, Marijn J. H. Heule:
A Flexible Proof Format for SAT Solver-Elaborator Communication. TACAS (1) 2021: 59-75 - [i8]Seulkee Baek, Mario Carneiro, Marijn J. H. Heule:
A Flexible Proof Format for SAT Solver-Elaborator Communication. CoRR abs/2109.09665 (2021) - 2020
- [c5]Mario Carneiro:
Metamath Zero: Designing a Theorem Prover Prover. CICM 2020: 71-88
2010 – 2019
- 2019
- [c4]Jeremy Avigad, Mario Carneiro, Simon Hudon:
Data Types as Quotients of Polynomial Functors. ITP 2019: 6:1-6:19 - [c3]Mario Carneiro:
Formalizing Computability Theory via Partial Recursive Functions. ITP 2019: 12:1-12:17 - [i7]Mario Carneiro:
Specifying verified x86 software from scratch. CoRR abs/1907.01283 (2019) - [i6]Mario Carneiro:
Metamath Zero: The Cartesian Theorem Prover. CoRR abs/1910.10703 (2019) - 2018
- [i5]Mario Carneiro:
Formalizing computability theory via partial recursive functions. CoRR abs/1810.08380 (2018) - 2016
- [j1]Mario Carneiro:
Conversion of HOL Light proofs into Metamath. J. Formaliz. Reason. 9(1): 187-200 (2016) - [c2]Mario Carneiro:
Formalization of the prime number theorem and Dirichlet's theorem. FM4M/MathUI/ThEdu/DP/WIP@CIKM 2016: 10-13 - [c1]Mario Carneiro:
Models for Metamath. FM4M/MathUI/ThEdu/DP/WIP@CIKM 2016: 187-203 - [i4]Mario Carneiro:
Models for Metamath. CoRR abs/1601.07699 (2016) - 2015
- [i3]Mario Carneiro:
Arithmetic in Metamath, Case Study: Bertrand's Postulate. CICM (Work in Progress) 2015: 3-18 - [i2]Mario Carneiro:
Arithmetic in Metamath, Case Study: Bertrand's Postulate. CoRR abs/1503.02349 (2015) - 2014
- [i1]Mario Carneiro:
Conversion of HOL Light proofs into Metamath. CoRR abs/1412.8091 (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 2024-04-24 22:52 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
