scientific article; zbMATH DE number 5580633

From MaRDI portal
Revision as of 22:48, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5322161

zbMath1172.03026MaRDI QIDQ5322161

Yiannis N. Moschovakis

Publication date: 20 July 2009


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

The Continuum HypothesisParallel Feedback Turing ComputabilityCountable ordinals in indiscernibility spectraCONSTRUCTING MAXIMAL COFINITARY GROUPSThe Kℵ0$K^{\aleph _0}$ game: Vertex colouringA syntactic approach to Borel functions: some extensions of Louveau's theoremStrong computable typeRecursive Polish spacesDeterminacy and regularity properties for idealized forcingsTHE DISCONTINUITY PROBLEMLocally hyperarithmetical inductionTall 𝐹_{𝜎} subideals of tall analytic idealsAn undecidable extension of Morley's theorem on the number of countable modelsThe axiom of determinacy implies dependent choice in miceCOUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATIONForcing the \(\Pi_3^1\)-reduction property and a failure of \(\Pi_3^1\)-uniformizationΣ1(κ)-DEFINABLE SUBSETS OF H(κ+)COMPUTABLY COMPACT METRIC SPACESProjective sets, intuitionisticallyClasses of Polish spaces under effective Borel isomorphismA game‐theoretic proof of Shelah's theorem on labeled treesIterates of $M_1$Unnamed ItemA Sacks indestructible co-analytic maximal eventually different familyEquivalence of codes for countable sets of realsOn the existence of small antichains for definable quasi-ordersFINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERSChoice free fixed point property in separable Banach spacesBisimilarity is not BorelPolishness of some topologies related to word or tree automataOn ⅁Γ-complete setsUnnamed ItemUnnamed ItemDetermined admissible setsLinear orders: When embeddability and epimorphism agreeA note on an effective Polish topology and Silver’s dichotomy theoremGAMES AND REFLECTION INPROVABLY GAMESA RECONSTRUCTION OF STEEL’S MULTIVERSE PROJECTLawvere-Tierney topologies for computability theoristsTHE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETICDETERMINACY OF SCHMIDT’S GAME AND OTHER INTERSECTION GAMESCH, \(V = L\), disintegration of measures, and \(\Pi_1^1\) setsThe size of the class of countable sequences of ordinalsFirst-order Gödel logicsUnnamed ItemDeterminacy and monotone inductive definitionsUniformity results on the Baire propertyInitial segment complexities of randomness notionsEffective aspects of Hausdorff and Fourier dimensionNon-collapse of the effective Wadge hierarchy\({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open setsOn the Lattices of Effectively Open SetsEquivalence of genericsThere is no bound on Borel classes of graphs in the Luzin–Novikov theoremOn reduction and separation of projective sets in Tychonoff spacesTowards the Effective Descriptive Set TheoryLebesgue's density theorem and definable selectors for idealsMaximal almost disjoint families, determinacy, and forcingEquivalence relations and determinacyVARIATIONS ON DETERMINACY AND ω1Long games and \(\sigma \)-projective setsOn images of partial computable functions over computable Polish spacesA characterization of \(\omega \)-limit sets in subshifts of Baire spaceEffective wadge hierarchy in computable quasi-Polish spacesBoundedness theorems for flowers and sharpsWadge-like degrees of Borel bqo-valued functionsMinimal controllability time for systems with nonlinear drift under a compact convex state constraintStrongly dominating sets of realsA characterization of bad approximabilityOn the scope of the Effros theoremDeterminacy of refinements to the difference hierarchy of co-analytic setsRandom geometric graphs and isometries of normed spacesForcing the Σ31-separation propertySouslin quasi-orders and bi-embeddability of uncountable structuresAnalytic sets of reals and the density function in the Cantor spaceStrongly unbounded and strongly dominating sets of reals generalizedSelective ultrafilters on FINIntuitionism and effective descriptive set theoryTHE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACYA recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theoryDescriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spacesΠ11‐Martin‐Löf randomness and Π11‐Solovay completenessA functional non-central limit theorem for multiple-stable processes with long-range dependenceUNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESSReal computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebraComplexity of Ramsey null setsOn the Reals Which Cannot Be RandomClassical descriptive set theory as a refinement of effective descriptive set theoryGroups, graphs, languages, automata, games and second-order monadic logicInside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functionsComputational capabilities of analog and evolving neural networks over infinite input streamsPrior knowledge and monotone decision problemsPolish group actions and effectivityThe descriptive complexity of connectedness in Polish spacesA characterization of \(\Sigma_1^1\)-reflecting ordinalsMathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)Hyperarithmetical SetsGames for the \(\mu\)-calculusProjective games on the reals







This page was built for publication: