Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Proofs involving the addition of natural numbers"'
Autor:
Jonathan J. White
Publikováno v:
PRIMUS. 27:725-735
A problem sequence is presented developing the basic properties of the set of natural numbers (including associativity and commutativity of addition and multiplication, among others) from the Peano axioms, with the last portion using von Neumann’s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65e317788b5e7c3d0d09a5fc9d96ed04
https://doi.org/10.1080/10511970.2016.1199619
https://doi.org/10.1080/10511970.2016.1199619
Autor:
Ján Haluška, Tomáš Gregor
Publikováno v:
Journal of Advanced Mathematics and Applications. 4:3-10
In this paper, we deal with generalizations of real Einstein numbers to various spaces and dimensions. We search operations and their properties in generalized settings. Especially, we are interested in the generalized operation of hyperbolic additio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f79c9b804f3101877f79f17c39fc2a3
https://doi.org/10.1166/jama.2015.1067
https://doi.org/10.1166/jama.2015.1067
Autor:
Shailesh A. Shirali
Publikováno v:
Resonance. 18:630-645
In Part I of this article we considered some binomial identities and also some identities involving the Fibonacci numbers, and proved them using methods which we described as ‘largely’ combinatorial. Now we shift our focus to number theory and to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99d5351aa0c68a245e5deede0ac3e7e2
https://doi.org/10.1007/s12045-013-0082-7
https://doi.org/10.1007/s12045-013-0082-7
Publikováno v:
computational complexity. 23:585-636
It is known that constant-depth Frege proofs of some tautologies require exponential size. No such lower bound result is known for more general proof systems. We consider tree-like sequent calculus proofs in which formulas can contain modular connect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a893278f34bc0f9408624612a007bce5
https://doi.org/10.1007/s00037-013-0064-x
https://doi.org/10.1007/s00037-013-0064-x
Autor:
David Weissman
Publikováno v:
Spinoza's Dream ISBN: 9783110479812
Spinoza's Dream: On Nature and Meaning
Spinoza's Dream: On Nature and Meaning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f482dd2b73c4434b871e7d95f670dd4
https://doi.org/10.1515/9783110479812-005
https://doi.org/10.1515/9783110479812-005
Publikováno v:
Annals of Combinatorics. 12:271-278
In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa4f28352347e4419155e43fa71e1d58
https://doi.org/10.1007/s00026-008-0350-5
https://doi.org/10.1007/s00026-008-0350-5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662479995
CRYPTO (2)
CRYPTO (2)
Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd930ecc9e5aa73c8f346ebcbe46ca7b
https://repository.ist.ac.at/671/
https://repository.ist.ac.at/671/
Autor:
Ron Aharoni
Publikováno v:
Mathematics, Poetry and Beauty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4af3b3f85cbdf2e7939046b8f5b1fed4
https://doi.org/10.1142/9789814602952_0011
https://doi.org/10.1142/9789814602952_0011
Publikováno v:
Logic, Language, and Computation ISBN: 9783662469057
TbiLLC
TbiLLC
By Gentzen's famous Hauptsatz the cut-elimination theorem every proof in sequent calculus for first-order logic with cuts can be transformed into a cut-free proof; cut-free proofs are analytic and consist entirely of syntactic material of the end-seq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e4ad7e6765e8e5d410519d5f6437734
https://doi.org/10.1007/978-3-662-46906-4_8
https://doi.org/10.1007/978-3-662-46906-4_8
We consider the effect of constraints on the number of non-negative integer solutions of x+y+z = n, relating the number of solutions to linear combinations of triangular numbers. Our approach is geometric and may be viewed as an introduction to proof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b55b089c8a15b3136f0a96f21a56dfcf