Results 261 to 270 of about 1,573,175 (303)
Some of the next articles are maybe not open access.
Journal of Economic Theory, 2014
We analyze an equilibrium concept called revision-proofness for infinite-horizon games played by a dynasty of players. Revision-proofness requires strategies to be robust to joint deviations by multiple players and is a refinement of sub-game perfection. Sub-game perfect paths that can only be sustained by reversion to paths with payoffs below those of
Laurence Ales, Christopher Sleet
openaire +2 more sources
We analyze an equilibrium concept called revision-proofness for infinite-horizon games played by a dynasty of players. Revision-proofness requires strategies to be robust to joint deviations by multiple players and is a refinement of sub-game perfection. Sub-game perfect paths that can only be sustained by reversion to paths with payoffs below those of
Laurence Ales, Christopher Sleet
openaire +2 more sources
Journal of Philosophical Logic, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Adapting proof automation to adapt proofs
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018We extend proof automation in an interactive theorem prover to analyze changes in specifications and proofs. Our approach leverages the history of changes to specifications and proofs to search for a patch that can be applied to other specifications and proofs that need to change in analogous ways.
Talia Ringer +3 more
openaire +2 more sources
Proofs of membership vs. proofs of knowledge
Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 2002We investigate the relationship between interactive proofs of membership and interactive proofs of knowledge. Previous results in this area show that many proofs of membership for some languages are also proofs of knowledge of an associated relation, raising the question of whether all proofs of membership are proofs of knowledge.
Giovanni Di Crescenzo +1 more
openaire +2 more sources
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
The Mathematics Teacher, 1926
We have all heard of pupils who “got by” in geometry by merely memorizing the proofs given in the book and of teachers who permitted them to “get by.” To such persons those proofs were not proofs. Assuming that such methods are passe if they have not passed all together, what limits are we to approach in the other direction?
openaire +1 more source
We have all heard of pupils who “got by” in geometry by merely memorizing the proofs given in the book and of teachers who permitted them to “get by.” To such persons those proofs were not proofs. Assuming that such methods are passe if they have not passed all together, what limits are we to approach in the other direction?
openaire +1 more source
Validation of HOL Proofs by Proof Checking
Formal Methods in System Design, 1999Formal proofs generated by mechanised theorem proving systems may consist of a large number of inferences. As these theorem proving systems are usually very complex, it is extremely difficult if not impossible to formally verify them. This calls for an independent means of ensuring the consistency of mechanically generated proofs.
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
Arguments and Proofs About Arguments and Proofs
2009Both rhetoric and mathematics are ancient, elaborate and still active fields of study that cover a time span of more than two millennia. That much, they undisputedly have in common. However, in the domain of mathematics one will search in vain for traces, positive or negative, of rhetoric, and in the domain of rhetoric, although the relation between ...
Van Bendegem, Jean, Coessens, Kathleen
openaire +2 more sources