Sciweavers

2131 search results - page 71 / 427
» Immunity for Closed Sets
Sort
View
APAL
2008
63views more  APAL 2008»
15 years 4 months ago
A standard model of Peano arithmetic with no conservative elementary extension
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
Ali Enayat
160
Voted
IANDC
2010
160views more  IANDC 2010»
15 years 1 months ago
Coequational logic for accessible functors
Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently,...
Daniel Schwencke
94
Voted
APAL
2010
68views more  APAL 2010»
15 years 4 months ago
Higher Kurtz randomness
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...
Bjørn Kjos-Hanssen, André Nies, Fran...
127
Voted
SAC
2008
ACM
15 years 4 months ago
Output-sensitive algorithms for Tukey depth and related problems
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
David Bremner, Dan Chen, John Iacono, Stefan Lange...
TPHOL
2003
IEEE
15 years 9 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning