793 search results - page 67 / 159 » Argumentation and standards of proof |
111
Voted
TCS
2011
14 years 7 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
121
Voted
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
105
Voted
JCT
2007
15 years 19 days ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every determinist...
102
Voted
JSYML
1998
15 years 12 days ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...