Sciweavers

1322 search results - page 25 / 265
» Unsound Theorem Proving
Sort
View
NDJFL
2010
13 years 2 months ago
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
Kenshi Miyabe
LCC
1994
209views Algorithms» more  LCC 1994»
13 years 11 months ago
On Herbrand's Theorem
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
Samuel R. Buss
MEMOCODE
2006
IEEE
14 years 1 months ago
Specifying and proving properties of timed I/O automata in the TIOA toolkit
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...
Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan M...
CSL
2008
Springer
13 years 9 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
Phuong Nguyen
COMBINATORICS
2000
75views more  COMBINATORICS 2000»
13 years 7 months ago
Franklin's Argument Proves an Identity of Zagier
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
Robin J. Chapman