13383 search results - page 290 / 2677 » Abstractions from proofs |
133
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
179
click to vote
IANDC
2010
15 years 5 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
154
click to vote
JAT
2010
15 years 5 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
188
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
180
click to vote
EJC
2011
15 years 1 months ago
2011
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...