Imagen de Portada

On the Decidability of Presburger Arithmetic Expanded with Powers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Karimov, Toghrul, Luca, Florian, Nieuwveld, Joris, Ouaknine, Joël, Worrell, James
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Decidability of Monadic Theories of Arithmetic Predicates
por: Berthé, Valérie, et al.
Publicado: (2024)

Multiple Reachability in Linear Dynamical Systems
por: Karimov, Toghrul, et al.
Publicado: (2024)

The Monadic Theory of Toric Words
por: Berthé, Valérie, et al.
Publicado: (2023)

Model Checking Markov Chains as Distribution Transformers
por: Aghamov, Rajab, et al.
Publicado: (2024)

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

The 2-Dimensional Constraint Loop Problem is Decidable
por: Guilmant, Quentin, et al.
Publicado: (2024)

Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers
por: Karimov, Toghrul
Publicado: (2024)

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

On the Complexity of the Skolem Problem at Low Orders
por: Bacik, Piotr, et al.
Publicado: (2025)

Model Checking Linear Temporal Logic with Standpoint Modalities
por: Aghamov, Rajab, et al.
Publicado: (2025)

Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions
por: Brown, Hera, et al.
Publicado: (2025)

Termination Analysis of Linear-Constraint Programs
por: Ben-Amram, Amir M., et al.
Publicado: (2025)

One-Parametric Presburger Arithmetic has Quantifier Elimination
por: Mansutti, Alessio, et al.
Publicado: (2025)

Automata on $S$-adic words
por: Berthé, Valérie, et al.
Publicado: (2025)

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

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
por: Su, Wanyun, et al.
Publicado: (2024)

Twisted rational zeros of linear recurrence sequences
por: Bilu, Yuri, et al.
Publicado: (2024)

Twisted rational zeros of linear recurrence sequences
por: Yuri Bilu, et al.
Publicado: (2025)

The complexity of Presburger arithmetic with power or powers
por: Benedikt, Michael, et al.
Publicado: (2023)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

On Presburger arithmetic extended with non-unary counting quantifiers
por: Habermehl, Peter, et al.
Publicado: (2022)

On Deciding Constant Runtime of Linear Loops
por: Frohn, Florian, et al.
Publicado: (2026)

Axiomatizations of Presburger Arithmetic With Predicates For Powers
por: Hieronymi, Philipp, et al.
Publicado: (2026)

Decidability of Quantum Modal Logic
por: Tokuo, Kenji
Publicado: (2026)

On two-variable guarded fragment logic with expressive local Presburger constraints
por: Lu, Chia-Hsuan, et al.
Publicado: (2022)

Decidability for Sturmian words
por: Hieronymi, Philipp, et al.
Publicado: (2021)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Decidability of Quasi-Dense Modal Logics
por: Ostropolski-Nalewaja, Piotr, et al.
Publicado: (2024)

Generalized Decidability via Brouwer Trees
por: de Jong, Tom, et al.
Publicado: (2026)

Deciding Equations in the Time Warp Algebra
por: van Gool, Sam, et al.
Publicado: (2023)

Decidability of extensions of Presburger arithmetic by generalised polynomials
por: Konieczny, Jakub
Publicado: (2024)

Satisfiability Modulo Exponential Integer Arithmetic
por: Frohn, Florian, et al.
Publicado: (2024)

Speedups for Presburger Arithmetic and Real Closed Fields
por: Pakhomov, Fedor, et al.
Publicado: (2026)

On the Counting Complexity of the Skolem Problem
por: Jindal, Gorav, et al.
Publicado: (2024)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms
por: Akshay, S., et al.
Publicado: (2025)

Deciding characteristic formulae: A journey in the branching-time spectrum
por: Aceto, Luca, et al.
Publicado: (2025)

Deciding Boolean Separation Logic via Small Models (Technical Report)
por: Dacík, Tomáš, et al.
Publicado: (2024)

Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof
por: Choffrut, Christian
Publicado: (2024)

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
por: Aceto, Luca, et al.
Publicado: (2025)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
por: Gokaj, Geri, et al.
Publicado: (2025)