Sciweavers

891 search results - page 41 / 179
» Full Abstraction for PCF
Sort
View
MOC
2002
98views more  MOC 2002»
13 years 7 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
LOGCOM
2010
104views more  LOGCOM 2010»
13 years 6 months ago
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Matthias Baaz, George Metcalfe
SLOGICA
2010
138views more  SLOGICA 2010»
13 years 6 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Knuth's balanced codes revisited
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
Jos H. Weber, Kees A. Schouhamer Immink
ISORC
2008
IEEE
14 years 2 months ago
Cyber Physical Systems: Design Challenges
Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Embedded computers and networks monitor and control the physical processes, usually with feedb...
Edward A. Lee