Sciweavers

233 search results - page 3 / 47
» An Existential Locality Theorem
Sort
View
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 8 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
PLILP
1998
Springer
14 years 27 days ago
A Hidden Herbrand Theorem
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
Joseph A. Goguen, Grant Malcolm, Tom Kemp
JAR
2008
95views more  JAR 2008»
13 years 8 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 8 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
JSYML
2006
84views more  JSYML 2006»
13 years 8 months ago
Bounded modified realizability
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
Fernando Ferreira, Ana Nunes