Sciweavers

1101 search results - page 34 / 221
» Forcing in proof theory
Sort
View
CADE
2010
Springer
13 years 8 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
POPL
2010
ACM
14 years 5 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
NN
2000
Springer
167views Neural Networks» more  NN 2000»
13 years 7 months ago
Blind signal processing by the adaptive activation function neurons
The aim of this paper is to study an Information Theory based learning theory for neural units endowed with adaptive activation functions. The learning theory has the target to fo...
Simone Fiori
JSYML
2002
81views more  JSYML 2002»
13 years 7 months ago
Group Configurations and Germs in Simple Theories
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...
Itay Ben-Yaacov
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
13 years 6 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas