Image de couverture de livre

Relative Constructibility via Generalised Sequential Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Lau, Desmond
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science 68Q09 (Primary) 03D60 (Secondary) F.1.1; F.1.3; F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023)

A Logspace Constructive Proof of L=SL
par: Buss, Sam, et autres
Publié: (2025)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
par: Schewe, Klaus-Dieter
Publié: (2020)

The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)

Loops, Inverse Limits and Non-Determinism
par: Brattka, Vasco
Publié: (2025)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
par: Huseynzade, Rafig
Publié: (2025)

A proof complexity conjecture and the Incompleteness theorem
par: Krajicek, Jan
Publié: (2023)

Exploring the abyss in Kleene's computability theory
par: Sanders, Sam
Publié: (2023)

Determination of the fifth Busy Beaver value
par: The bbchallenge Collaboration, et autres
Publié: (2025)

Computability of Initial Value Problems
par: Brattka, Vasco, et autres
Publié: (2024)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

Forcing as a Local Method of Accessing Small Extensions
par: Lau, Desmond
Publié: (2024)

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

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2025)

Computability of the Hahn-Banach Theorem Revisited
par: Brattka, Vasco, et autres
Publié: (2026)

Strategies, model checking and branching-time properties in Maude
par: Rubio, Rubén, et autres
Publié: (2024)

Model checking strategy-controlled systems in rewriting logic
par: Rubio, Rubén, et autres
Publié: (2024)

A declarative approach to specifying distributed algorithms using three-valued modal logic
par: Gabbay, Murdoch J., et autres
Publié: (2025)

Extended Nullstellensatz proof systems
par: Krajicek, Jan
Publié: (2023)

Simulating and model checking membrane systems using strategies in Maude
par: Rubio, Rubén, et autres
Publié: (2024)

Punctually Standard and Nonstandard Models of Natural Numbers
par: Bazhenov, Nikolay, et autres
Publié: (2026)

On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
par: Bacik, Piotr, et autres
Publié: (2026)

Nominal techniques as an Agda library
par: Gabbay, Murdoch J., et autres
Publié: (2026)

Proof complexity of universal algebra in a CSP dichotomy proof
par: Gaysin, Azza
Publié: (2024)

An Expressive Trace Logic for Recursive Programs
par: Gurov, Dilian, et autres
Publié: (2024)

On the Realizability of Prime Conjectures in Heyting Arithmetic
par: Rosko, Milan
Publié: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
par: Rahnama, Moses
Publié: (2025)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
par: Bruse, Florian, et autres
Publié: (2026)

On some computational properties of open sets
par: Normann, Dag, et autres
Publié: (2024)

Turing machines deciders, part I
par: The bbchallenge Collaboration, et autres
Publié: (2025)

Conformance Games for Graded Semantics
par: Forster, Jonas, et autres
Publié: (2024)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
par: Lopez, Aliaume
Publié: (2024)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
par: Vodrazka, Daniel
Publié: (2025)

Arithmetics within the Linear Time Hierarchy
par: Pollett, Chris
Publié: (2025)

Effective bases and notions of effective second countability in computable analysis
par: Brattka, Vasco, et autres
Publié: (2025)

Hardness of busy beaver value BB(15)
par: Stérin, Tristan, et autres
Publié: (2021)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
par: Lopez, Aliaume
Publié: (2024)

2-Coherent Internal Models of Homotopical Type Theory
par: Chen, Joshua
Publié: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
par: Pradic, Cécilia
Publié: (2024)

Weihrauch problems as containers
par: Pradic, Cécilia, et autres
Publié: (2025)