61 search results - page 4 / 13 » What Is the Problem with Proof Nets for Classical Logic |
ITICSE
2010
ACM
13 years 9 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
EATCS
2000
13 years 7 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
TPHOL
2005
IEEE
14 years 28 days ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
APN
2005
Springer
14 years 27 days ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...