Cover Image

Deciding subspace reachability problems with application to Skolem's Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Everett, Samuel
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science 11B37, 03D99, 68Q01 F.0; G.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

On the $p$-adic Skolem Problem
by: Bacik, Piotr, et al.
Published: (2025)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
by: Jaakkola, Reijo, et al.
Published: (2024)

The syntactic side of autonomous categories enriched over generalised metric spaces
by: Dahlqvist, Fredrik, et al.
Published: (2022)

Constraint satisfaction problems, compactness and non-measurable sets
by: Tardif, Claude
Published: (2025)

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

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

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
by: Park, Sewon, et al.
Published: (2016)

On Expansions of Monadic Second-Order Logic with Dynamical Predicates
by: Nieuwveld, Joris, et al.
Published: (2025)

Descriptive complexity for neural networks via Boolean networks
by: Ahvonen, Veeti, et al.
Published: (2023)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

A Complete V-Equational System for Graded lambda-Calculus
by: Dahlqvist, Fredrik, et al.
Published: (2023)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

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

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
by: Grochow, Joshua A., et al.
Published: (2022)

Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)

A Constructive Proof of Rice's Theorem and the Halting Problem via Hilbert's Tenth Problem
by: Brossard, Jonathan
Published: (2026)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Artifical intelligence and inherent mathematical difficulty
by: Dean, Walter, et al.
Published: (2024)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
by: Ye, Lixi
Published: (2026)

Remarks on Primitive Regulation
by: Rosko, Milan
Published: (2026)

Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)

Robustness of Boolean networks to update modes: an application to hereditary angioedema
by: Demongeot, Jacques, et al.
Published: (2025)

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma
by: Mourad, Daniel
Published: (2024)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Decidable Reversible Equivalences for Finite Petri Nets
by: Gorrieri, Roberto, et al.
Published: (2025)

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

A Minimal Substitution Basis for the Kalmár Elementary Functions
by: Prunescu, Mihai, et al.
Published: (2025)

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

A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)

On a Rice theorem for dynamical properties of SFTs on groups
by: Carrasco-Vargas, Nicanor
Published: (2024)

Serial Properties, Selector Proofs, and the Provability of Consistency
by: Artemov, Sergei
Published: (2024)

Non-Compact Proofs
by: Artemov, Sergei
Published: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
by: Artemov, Sergei
Published: (2025)

Report of the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science
by: McInnes, Lois Curfman, et al.
Published: (2025)

Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning
by: Galmiche, Didier, et al.
Published: (2024)