:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Franklin, Johanna N. Y., Hölzl, Rupert, Melnikov, Alexander, Ng, Keng Meng, Turetsky, Daniel
Format:	Preprint
Published:	2020
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2010.09499
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)

Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)

Failure Modes for Structural Highness Notions
by: Calvert, Wesley, et al.
Published: (2025)

The subTuring degrees
by: Kihara, Takayuki, et al.
Published: (2024)

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

Primitive recursive categoricity spectra of functional structures
by: Bazhenov, Nikolay, et al.
Published: (2026)

Computably totally disconnected locally compact groups
by: Melnikov, Alexander, et al.
Published: (2022)

Independence and Induction in Reverse Mathematics
by: Belanger, David, et al.
Published: (2024)

Primitive recursive categoricity spectra
by: Bazhenov, Nikolay, et al.
Published: (2026)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

sp-Homogeneous Linear Orderings
by: Calvert, Wesley, et al.
Published: (2025)

Computably locally compact groups and their closed subgroups
by: Melnikov, Alexander G., et al.
Published: (2024)

The singleton degrees of the $Σ^0_2$ sets are not dense
by: Kent, Thomas F., et al.
Published: (2024)

Algorithmic randomness in harmonic analysis
by: Franklin, Johanna N. Y., et al.
Published: (2026)

Topology, forcing, and graph colourings
by: Greenberg, Noam, et al.
Published: (2026)

Conjunctive reducibilities and completeness
by: Chitaia, Irakli, et al.
Published: (2026)

Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024)

Iterated Priority Arguments in Descriptive Set Theory
by: Day, Adam, et al.
Published: (2022)

On classification of continuous first order theories
by: Khanaki, Karim
Published: (2022)

Inconsistency of Reinhardt cardinals with $\mathsf{ZF}$
by: McCallum, Rupert
Published: (2026)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Normality, Relativization, and Randomness
by: Calvert, Wesley, et al.
Published: (2023)

Open Problems in Computability Theory and Descriptive Set Theory
by: Barmpalias, George, et al.
Published: (2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

CMSO-transducing tree-like graph decompositions
by: Campbell, Rutger, et al.
Published: (2024)

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
by: Dartois, Luc, et al.
Published: (2026)

When Darwin met Ianus: dichotomies of expressivity
by: Brunar, Johanna, et al.
Published: (2025)

Growth of regular partitions 2: Weak regularity
by: Terry, C.
Published: (2024)

A classification of incompleteness statements
by: Towsner, Henry, et al.
Published: (2024)

Computability of Brjuno-like functions
by: Shevchenko, Ivan O., et al.
Published: (2025)

On the regularity of almost stable relations
by: Girón, Marcos
Published: (2025)

Definability in affine continuous logic
by: Bagheri, Seyed-Mohammad
Published: (2024)

Scott analysis, linear orders and almost periodic functions
by: Gonzalez, David, et al.
Published: (2024)

Growth of regular partitions 4: strong regularity and the pairs partition
by: Terry, C.
Published: (2024)

Growth of regular partitions 3: strong regularity and the vertex partition
by: Terry, C.
Published: (2024)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)