Results 271 to 280 of about 4,888,581 (309)
Some of the next articles are maybe not open access.
2018
Proof theory is a branch of mathematical logic founded by David Hilbert around 1920 to pursue Hilbert’s programme. The problems addressed by the programme had already been formulated, in some sense, at the turn of the century, for example, in Hilbert’s famous address to the First International Congress of Mathematicians in Paris.
openaire +1 more source
Proof theory is a branch of mathematical logic founded by David Hilbert around 1920 to pursue Hilbert’s programme. The problems addressed by the programme had already been formulated, in some sense, at the turn of the century, for example, in Hilbert’s famous address to the First International Congress of Mathematicians in Paris.
openaire +1 more source
Journal of Philosophical Logic, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Combinatorial proofs and algebraic proofs — II
Resonance, 2013In 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 prime numbers in particular, and showcase some proofs having a strong combinatorial element.
openaire +1 more source
1998
To prove that the top-down algorithm in Figure 3.27 terminates, we argue that there is only a finite number of revisables and subsequently only a finite number of possible nodes. With a node being marked in each step of loop (2) the algorithm terminates. The second part of the theorem that H(n) is a hitting-set iff n is a leaf marked ✓ is true since we
openaire +1 more source
To prove that the top-down algorithm in Figure 3.27 terminates, we argue that there is only a finite number of revisables and subsequently only a finite number of possible nodes. With a node being marked in each step of loop (2) the algorithm terminates. The second part of the theorem that H(n) is a hitting-set iff n is a leaf marked ✓ is true since we
openaire +1 more source
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Annual International Cryptology Conference, 2017A. Kiayias +3 more
semanticscholar +1 more source
International Journal for Philosophy of Religion, 1977
Two claims have been explored, the first, that fool-proof proofs of the sort that there could be if there were a God like the God of Abraham, Isaac and Jacob are not to be expected, on good religious grounds (a claim I found wanting); and second, that there cannot be philosophical proofs of God which work beyond reasonable doubt.
openaire +1 more source
Two claims have been explored, the first, that fool-proof proofs of the sort that there could be if there were a God like the God of Abraham, Isaac and Jacob are not to be expected, on good religious grounds (a claim I found wanting); and second, that there cannot be philosophical proofs of God which work beyond reasonable doubt.
openaire +1 more source
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
International Conference on the Theory and Application of Cryptographic Techniques, 2018B. David +3 more
semanticscholar +1 more source
Non-Interactive Proofs of Proof-of-Work
IACR Cryptology ePrint Archive, 2020A. Kiayias +2 more
semanticscholar +1 more source