Image de couverture de livre

Decidability of MSO Reparameterization over Countable Chains

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Rabinovich, Alexander
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Church Synthesis Problem over Continuous Time
par: Rabinovich, Alexander, et autres
Publié: (2024)

Low rank MSO
par: Bojańczyk, Mikołaj, et autres
Publié: (2025)

Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words
par: Piórkowski, Radosław
Publié: (2026)

Countability constraints in order-theoretic approaches to computability
par: Hack, Pedro, et autres
Publié: (2022)

A Dichotomy Theorem for Ordinal Ranks in MSO
par: Niwiński, Damian, et autres
Publié: (2025)

Tree algebras and bisimulation-invariant MSO on finite graphs
par: Colcombet, Thomas, et autres
Publié: (2024)

Synthesis of Infinite State Systems
par: Drucker, Ohad, et autres
Publié: (2025)

Decidability of Quantum Modal Logic
par: Tokuo, Kenji
Publié: (2026)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Decidability for Sturmian words
par: Hieronymi, Philipp, et autres
Publié: (2021)

Generalized Decidability via Brouwer Trees
par: de Jong, Tom, et autres
Publié: (2026)

Dynamic Probability Logic: Decidability & Computability
par: Chopoghloo, Somayeh, et autres
Publié: (2024)

Decidability of Quasi-Dense Modal Logics
par: Ostropolski-Nalewaja, Piotr, et autres
Publié: (2024)

Deciding Equations in the Time Warp Algebra
par: van Gool, Sam, et autres
Publié: (2023)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
par: Artale, Alessandro, et autres
Publié: (2025)

Terminal Coalgebras in Countably Many Steps
par: Adámek, Jiří, et autres
Publié: (2023)

Measuring Decidability as Related to Busy Beaver Numbers
par: Tandi, Gurpreet, et autres
Publié: (2026)

On Deciding Constant Runtime of Linear Loops
par: Frohn, Florian, et autres
Publié: (2026)

On the Decidability of Monadic Theories of Arithmetic Predicates
par: Berthé, Valérie, et autres
Publié: (2024)

Deciding Termination of Simple Randomized Loops
par: Meyer, Éléanore, et autres
Publié: (2025)

On the Decidability of Presburger Arithmetic Expanded with Powers
par: Karimov, Toghrul, et autres
Publié: (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
par: Amarilli, Antoine, et autres
Publié: (2023)

The 2-Dimensional Constraint Loop Problem is Decidable
par: Guilmant, Quentin, et autres
Publié: (2024)

Craig Interpolation for Decidable First-Order Fragments
par: Cate, Balder ten, et autres
Publié: (2023)

FO logic on cellular automata orbits equals MSO logic
par: Theyssier, Guillaume
Publié: (2024)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
par: Kleest-Meißner, Sarah, et autres
Publié: (2022)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
par: Balasubramanian, A. R.
Publié: (2024)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
par: Su, Wanyun, et autres
Publié: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
par: Li, Yongming
Publié: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
par: Ratschan, Stefan
Publié: (2023)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
par: Gamsakhurdia, Mariami, et autres
Publié: (2025)

Decidability of Graph Neural Networks via Logical Characterizations
par: Benedikt, Michael, et autres
Publié: (2024)

Deciding characteristic formulae: A journey in the branching-time spectrum
par: Aceto, Luca, et autres
Publié: (2025)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
par: Kurucz, Agi, et autres
Publié: (2023)

The structure of polynomial growth for tree automata/transducers and MSO set queries
par: Gallot, Paul, et autres
Publié: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
par: Haase, Christoph, et autres
Publié: (2024)

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
par: Neumann, Eike
Publié: (2025)

Deciding Boolean Separation Logic via Small Models (Technical Report)
par: Dacík, Tomáš, et autres
Publié: (2024)

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
par: Cesco, Arnaldo, et autres
Publié: (2021)