11160 search results - page 2181 / 2232 » Incompleteness in a General Setting |
106
Voted
MLQ
2002
15 years 3 months ago
2002
Abstract. In this paper I compare two well studied approaches to topological semantics-the domain-theoretic approach, exemplified by the category of countably based equilogical spa...
123
click to vote
JSYML
1998
15 years 3 months 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 ...
119
Voted
TC
1998
15 years 3 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
131
Voted
TCS
1998
15 years 3 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
159
Voted
TIT
1998
15 years 3 months ago
1998
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...