APAL
2011
13 years 2 months ago
2011
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
24
Voted
APAL
2011
13 years 2 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
APAL
2011
13 years 2 months ago
2011
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
APAL
2011
13 years 2 months ago
2011
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we d...
APAL
2011
13 years 2 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
AOSD
2011
ACM
13 years 2 months ago
2011
ACM
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...
AOSD
2011
ACM
13 years 2 months ago
2011
ACM
AOSD
2011
ACM
13 years 2 months ago
2011
ACM
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
AOSD
2011
ACM
13 years 2 months ago
2011
ACM
AOSD
2011
ACM
13 years 2 months ago
2011
ACM