4978 search results - page 263 / 996 » Logical models of argument |
ENTCS
2006
15 years 6 months ago
2006
The -calculus is destructive: its main computational mechanism
172
click to vote
LOGCOM
2008
15 years 5 months ago
2008
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
187
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
184
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
139
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...