Sciweavers

1410 search results - page 38 / 282
» Proving theorems by reuse
Sort
View
DLT
2009
13 years 7 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
BIRTHDAY
2010
Springer
13 years 11 months ago
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Vladik Kreinovich
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 9 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
TLCA
2009
Springer
14 years 4 months ago
On the Meaning of Logical Completeness
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
Michele Basaldella, Kazushige Terui
MKM
2005
Springer
14 years 3 months ago
A Proof-Theoretic Approach to Hierarchical Math Library Organization
Abstract. The relationship between theorems and lemmas in mathematical reasoning is often vague. No system exists that formalizes the structure of theorems in a mathematical librar...
Kamal Aboul-Hosn, Terese Andersen