300 search results - page 25 / 60 » The Extension Theorem |
102
Voted
COMBINATORICS
2004
14 years 11 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
70
Voted
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
MEMOCODE
2006
IEEE
15 years 5 months ago
2006
IEEE
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
TPHOL
2000
IEEE
15 years 2 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...