:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Graça, Daniel S., Zhong, Ning
Format:	Preprint
Published:	2023
Subjects:	Logic Logic in Computer Science Dynamical Systems 03D78 (Primary) 37D05, 34E10 (Secondary) F.4.1; F.1.1
Online Access:	https://arxiv.org/abs/2305.14448
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025)

On computability of equilibrium states
by: Binder, Ilia, et al.
Published: (2023)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

Forcing with Language Fragments, Extending Namba Forcing, and Models of Theories with Constraints in Interpretation
by: Lau, Desmond
Published: (2024)

Forcing as a Local Method of Accessing Small Extensions
by: Lau, Desmond
Published: (2024)

Reordered Computable Numbers
by: Janicki, Philip
Published: (2023)

Punctually Standard and Nonstandard Models of Natural Numbers
by: Bazhenov, Nikolay, et al.
Published: (2026)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

The surjection property and computable type
by: Amir, Djamel Eddine, et al.
Published: (2023)

Computable thermodynamic formalism
by: Binder, Ilia, et al.
Published: (2025)

On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
by: Bacik, Piotr, et al.
Published: (2026)

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
by: Cerda, Rémy, et al.
Published: (2022)

Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)

On the computational properties of ambivalent sets and functions
by: Normann, Dag, et al.
Published: (2026)

A Lopez-Escobar Theorem for Continuous Domains
by: Bazhenov, Nikolay, et al.
Published: (2023)

Undecidability in Relevant Logic
by: Knudstorp, Søren Brinck
Published: (2026)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

Conjunctive categorial grammars and Lambek grammars with additives
by: Kuznetsov, Stepan L., et al.
Published: (2024)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Cut elimination for propositional cyclic proof systems with fixed-point operators
by: Hori, Hiromasa, et al.
Published: (2023)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

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

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Gödel coding on fibrations and geminal categories
by: Ikeda, Yuto
Published: (2026)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

Ramsey expansions of metrically homogeneous graphs
by: Aranda, Andrés, et al.
Published: (2017)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

Uniform Computability of PAC Learning
by: Brattka, Vasco, et al.
Published: (2026)