Structural foundations for probabilistic programming languages অনুযায়ী Stein, DM

বিষয়গুলি:

Turing degrees in Polish spaces and decomposability of Borel functions অনুযায়ী Gregoriades, Vassillos, Kihara, Takayuki, Ng, Meng Keng

“…We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. …”
সম্পূর্ণ পাঠ পাওয়ার জন্য

Probabilistic programming semantics for name generation অনুযায়ী Sabok, M, Staton, S, Stein, D, Wolman, M

“…Our tools are diverse and include descriptive set theory and normal forms for the ν-calculus.…”

Expressing Cardinality Quantifiers in Monadic Second−Order Logic over Trees অনুযায়ী Barany, V, Kaiser, L, Rabinovich, A

“…Our approach is based on Shelah's composition method and uses basic results from descriptive set theory. The elimination result is constructive, yielding a decision procedure for the extended logic.…”

Nonhyperbolic one-dimensional invariant sets with a countably infinite collection of inhomogeneities অনুযায়ী Good, C, Knight, R, Raines, B

“…Using tools from descriptive set theory we prove a surprising restriction on the topological structure of these invariant sets if the map satisfies a weak repelling or attracting condition. …”

Cardinality quantifiers in MLO over trees অনুযায়ী Barany, V, Kaiser, L, Rabinovich, A

“…Our approach is based on Shelah's composition method and uses basic results from descriptive set theory. The elimination result is constructive, yielding a decision procedure for the extended logic. …”

2-tactics in the Choquet game, and the filter dichotomy অনুযায়ী Lupton, R, Richard Lupton

“…The first part (Chapter 1) concerns a problem born from descriptive set theory, and is motivated by the desire to understand a particular topological game, in the presence of examples which exhibit interesting (arguably counterintuitive) behaviour. …”