Sciweavers

5 search results - page 1 / 1
» The strength of sharply bounded induction
Sort
View
MLQ
2006
92views more  MLQ 2006»
13 years 4 months ago
The strength of sharply bounded induction
We prove that the sharply bounded arithmetic T0 2 in a language containing the function symbol x
Emil Jerábek
APAL
2010
67views more  APAL 2010»
13 years 5 months ago
The strength of sharply bounded induction requires MSP
Sedki Boughattas, Leszek Aleksander Kolodziejczyk
APAL
2011
12 years 12 months ago
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
Gerhard Jäger, Dieter Probst
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
13 years 8 months ago
Efficient Detection of Local Interactions in the Cascade Model
Detection of interactions among data items constitutes an essential part of knowledge discovery. The cascade model is a rule induction methodology using levelwise expansion of a la...
Takashi Okada
CSL
2007
Springer
13 years 11 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann