Translating proofs from an impredicative type system to a predicative one

T Felicissimo, F Blanqui, AK Barnawal - arXiv preprint arXiv:2211.05700, 2022 - arxiv.org
As the development of formal proofs is a time-consuming task, it is important to devise ways
of sharing the already written proofs to prevent wasting time redoing them. One of the …

Nine chapters of analytic number theory in Isabelle/HOL

M Eberl - 10th International Conference on Interactive Theorem …, 2019 - drops.dagstuhl.de
In this paper, I present a formalisation of a large portion of Apostol's Introduction to Analytic
Number Theory in Isabelle/HOL. Of the 14 chapters in the book, the content of 9 has been …

[PDF][PDF] Sharing proofs with predicative theories through universe-polymorphic elaboration

T Felicissimo, F Blanqui - Logical Methods in Computer …, 2024 - lmcs.episciences.org
As the development of formal proofs is a time-consuming task, it is important to devise ways
of sharing the already written proofs to prevent wasting time redoing them. One of the …

A formal proof of borodin-trakhtenbrot's gap theorem

A Asperti - International Conference on Certified Programs and …, 2013 - Springer
In this paper, we discuss the formalization of the well known Gap Theorem of Complexity
Theory, asserting the existence of arbitrarily large gaps between complexity classes. The …

Reverse complexity

A Asperti - Journal of Automated Reasoning, 2015 - Springer
Reverse Complexity is a long term research program aiming at discovering the abstract,
logical principles underlying Complexity Theory, by means of a formal, reverse analysis of its …

[PDF][PDF] GOLDBACH APPROACH

POFE NUMBERS - 2022 - researchgate.net
ABSTRACT" A mathematician, like a painter or a poet, is a pattern maker. If his patterns are
more permanent than theirs, it is because they are made with ideas." GH Hardy Goldbach …

Αλγοριθμικές διαδικασίες ως κύρια μαθηματική γνώση: διδασκαλία και μάθησή τους στο δημοτικό σχολείο

Α Μαστρογιάννης - 2020 - didaktorika.gr
Οι αλγόριθμοι αποτελούν κύριο και ουσιώδες κομμάτι της διαδικαστικής γνώσης στα
Μαθηματικά. Μάλιστα, τα Μαθηματικά, υπό μία διασταλτική έννοια, είναι μόνο αλγόριθμοι. Ως …

The speedup theorem in a primitive recursive framework

A Asperti - Proceedings of the 2015 Conference on Certified …, 2015 - dl.acm.org
Blum's speedup theorem is a major theorem in computational complexity, showing the
existence of computable functions for which no optimal program can exist: for any speedup …

[引用][C] Bertrand's Postulate

U Dudley - 2016