265 search results - page 36 / 53 » How to Prove Inductive Theorems |
AI
2007
Springer
13 years 7 months ago
2007
Springer
The AGM postulates for belief revision, augmented by the DP postulates for iterated belief revision, provide generally accepted criteria for the design of operators by which intel...
JSYML
2002
13 years 7 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
TAP
2010
Springer
13 years 5 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...