Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Matita"'
Autor:
Andrea Asperti, Wilmer Ricciotti
Publikováno v:
Journal of Formalized Reasoning, Vol 5, Iss 1, Pp 37-57 (2012)
We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand's postulate.Even if Chebyshev's result has been later superseded by
Externí odkaz:
https://doaj.org/article/047d370e0d2d4001a7ca40b1010d91b2
Autor:
Ferruccio Guidi
Publikováno v:
Journal of Formalized Reasoning, Vol 5, Iss 1, Pp 1-25 (2012)
We present a formalization of pure lambda-calculus for the Matita interactive theorem prover, including the proofs of two relevant results in reduction theory: the confluence theorem and the standardization theorem. The proof of the latter is based o
Externí odkaz:
https://doaj.org/article/90b4907c97f543ce94d467c11c68093d
Autor:
Claudio Sacerdoti Coen, Enrico Tassi
Publikováno v:
Journal of Formalized Reasoning, Vol 1, Iss 1, Pp 51-89 (2008)
We present a formalisation of a constructive proof of Lebesgue’s Dominated Convergence Theorem given by the Sacerdoti Coen and Zoli in [CSCZ]. The proof is done in the abstract setting of ordered uniformities, also introduced by the two authors as
Externí odkaz:
https://doaj.org/article/bd8166fde76742b5a5e305272965af31
Autor:
Cristian Armentano, Andrea Asperti
Publikováno v:
Journal of Formalized Reasoning, Vol 1, Iss 1, Pp 1-23 (2008)
We discuss the formalization, in the Matita Interactive Theorem Prover, of a few elementary results in number theory about the Moebius mu function and the Euler phi function.
Externí odkaz:
https://doaj.org/article/0deb4b0ab0a94c8d87d3e77433a7cedc
Autor:
NAVODARU Ion, CERNISENCU Irina
Publikováno v:
Scientific Annals of the Danube Delta Institute, Vol 12, Pp 177-180 (2006)
The fish catch from riverine Danube delta has changed in both structure and size. The average of catches decreased from 1747 t (1963 - 1974) to 252 t (1992 - 2003) in Gorgova–Uzlina lake-complex and from 1,634 t to 211 t in Sontea–Furtuna lake-co
Externí odkaz:
https://doaj.org/article/1c2b578373f94275b6fee3eb730656df
Autor:
Thiré, François
Publikováno v:
Computer Science [cs]. ENS Paris-Saclay, 2020. English
Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
Programming Languages [cs.PL]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
Computer Science [cs]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
Programming Languages [cs.PL]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
Computer Science [cs]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩
There is today a large family of proof systems based upon variouslogics: The Calculus of Inductive Constructions, Higher-Order logic orSet theory, etc. The diversity of proof systems has the negativeconsequence that theorems are formalized many times
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2ba7f54a23b25c4596a2b3c6565b1860
https://hal.archives-ouvertes.fr/tel-03224039
https://hal.archives-ouvertes.fr/tel-03224039
Autor:
Fantini, Silvia
Publikováno v:
ENTHYMEMA; N. 25 (2020); 608-628
ENTHYMEMA; No 25 (2020); 608-628
ENTHYMEMAInternational journal of literary criticism, literary theory,and philosophy of literature; № 25 (2020); 608-628
ENTHYMEMA; Nr. 25 (2020); 608-628
ENTHYMEMA; Núm. 25 (2020); 608-628
Enthymema, Iss 25 (2020)
ENTHYMEMA; No 25 (2020); 608-628
ENTHYMEMAInternational journal of literary criticism, literary theory,and philosophy of literature; № 25 (2020); 608-628
ENTHYMEMA; Nr. 25 (2020); 608-628
ENTHYMEMA; Núm. 25 (2020); 608-628
Enthymema, Iss 25 (2020)
This article compares the metapoetic works on the act of writing by Valerio Magrelli (Roma, 1975) and by Pierluigi Cappello (Gemona del Friuli, 1967 – Cassacco, 2017). After studying and sampling the metapoetic vocabulary of each author, I selected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f75f188315c72b3075e8c7e9c5416b0
https://riviste.unimi.it/index.php/enthymema/article/view/13699
https://riviste.unimi.it/index.php/enthymema/article/view/13699
Autor:
ANGELICO, Emanuele
L’architetto di ogni tempo, ha curato, programmato e progettato il territorio nei suoi aspetti funzionali ed estetici. Con il senno di poi ci si domanda ragionevolmente se questo avesse sempre fatto bene, occupandosi anche delle ricadute del propri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3658::7b3dd4221ef74dd718881845f3c2342d
http://hdl.handle.net/10447/432362
http://hdl.handle.net/10447/432362
Autor:
Andrea Asperti, Wilmer Ricciotti
Publikováno v:
Asperti, A & Ricciotti, W 2015, ' A formalization of multi-tape Turing machines ', Theoretical Computer Science, vol. 603, pp. 23-42 . https://doi.org/10.1016/j.tcs.2015.07.013
We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::154442b60c53f89e7e75cc70653a5926
https://doi.org/10.1016/j.tcs.2015.07.013
https://doi.org/10.1016/j.tcs.2015.07.013
Este trabalho teve como propósito central investigar a sonoridade jobiniana na obra Matita Perê (1973), de Tom Jobim e Paulo César Pinheiro. Para isso, concentrou-se em pesquisar de que maneira Claus Ogerman contribuiu para o resultado idealizado