10 search results - page 2 / 2 » A Constructive Proof of the Heine-Borel Covering Theorem for... |
APAL
2006
13 years 7 months ago
2006
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
TACAS
2000
Springer
13 years 11 months ago
2000
Springer
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly...