Sciweavers

64 search results - page 13 / 13
» Proving Church's Thesis
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
CCR
2010
102views more  CCR 2010»
13 years 5 months ago
FIE: future internet enervation
I'm so Bored of the Future Internet (FI). There are so many initiatives to look at the Internet's Future1 , anyone would think that there was some tremendous threat like...
Jon Crowcroft
JOLLI
2008
95views more  JOLLI 2008»
13 years 5 months ago
Relational Modality
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Kathrin Glüer, Peter Pagin
JSYML
2000
103views more  JSYML 2000»
13 years 5 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon