1101 search results - page 85 / 221 » Forcing in proof theory |
133
Voted
JCT
2007
15 years 3 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
127
click to vote
MKM
2007
Springer
15 years 9 months ago
2007
Springer
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
134
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
134
click to vote
FC
1998
Springer
15 years 7 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
133
click to vote
CONTEXT
2001
Springer
15 years 8 months ago
2001
Springer
A recent report by the National Research Council (NRC) declares neural networks “hold the most promise for providing powerful learning models”. While some researchers have expe...