Sciweavers

351 search results - page 35 / 71
» Classical proof forestry
Sort
View
AML
2002
70views more  AML 2002»
13 years 7 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
IPL
2010
80views more  IPL 2010»
13 years 6 months ago
Rate monotonic scheduling re-analysed
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
Qiwen Xu, Naijun Zhan
CSL
2001
Springer
14 years 5 days ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ď...
Frédéric Koriche
ICFP
2000
ACM
14 years 23 hour ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
LICS
2007
IEEE
14 years 1 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...