64 search results - page 6 / 13 » Proving Church's Thesis |
104
click to vote
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
101
Voted
ISBRA
2009
Springer
15 years 6 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
JSYML
2006
14 years 11 months ago
2006
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
105
click to vote
DAGSTUHL
2001
15 years 1 months ago
2001
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
68
Voted
ALIFE
2002
14 years 11 months ago
2002
: We use the term 'Strong Artificial Life' to refer to the thesis that a sufficiently sophisticated computer simulation of a life-form is a life-form in its own right. Ca...