:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Jovanovic, Dejan
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2605.26181
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Undecidability of theories of semirings with fixed points
by: Das, Anupam, et al.
Published: (2025)

The Undecidability of Quantified Announcements
by: Ågotnes, Thomas, et al.
Published: (2024)

Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)

Undecidability of Linear Logics without Weakening
by: Suzuki, Jun, et al.
Published: (2025)

Improving NLSAT for Nonlinear Real Arithmetic
by: Wang, Zhonghan
Published: (2024)

Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
by: Dudenhefner, Andrej
Published: (2026)

Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
by: Lipparini, Enrico, et al.
Published: (2025)

Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)

An Undecidability Proof for the Plan Existence Problem
by: Achilleos, Antonis
Published: (2026)

On Formally Undecidable Traits of Intelligent Machines
by: Fox, Matthew
Published: (2024)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
by: Fortin, Marie, et al.
Published: (2023)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
by: Kihara, Takayuki
Published: (2024)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
by: Kobayashi, Naoki
Published: (2024)

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
by: Nakamura, Yoshiki
Published: (2025)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
by: Czerwiński, Wojciech, et al.
Published: (2025)

MCSAT Modulo Transcendental Arithmetics
by: Gallego-Hernández, Jorge, et al.
Published: (2026)

Peano Arithmetic and $μ$MALL
by: Manighetti, Matteo, et al.
Published: (2023)

Towards an Analysis of Proofs in Arithmetic
by: Leitsch, Alexander, et al.
Published: (2025)

RTAMT -- Runtime Robustness Monitors with Application to CPS and Robotics
by: Yamaguchi, Tomoya, et al.
Published: (2025)

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

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)

Teaching Divisibility and Binomials with Coq
by: Boldo, Sylvie, et al.
Published: (2024)

The Constraint Satisfaction Problem Over Multisorted Cores
by: Delic, Dejan, et al.
Published: (2025)

Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy
by: Bonakdarpour, Borzoo, et al.
Published: (2024)

Interpolant Existence is Undecidable for Two-Variable First-Order Logic with Two Equivalence Relations
by: Wolter, Frank, et al.
Published: (2024)

Incorrectness Separation Logic with Arrays and Pointer Arithmetic
by: Lee, Yeonseok, et al.
Published: (2025)

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

The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)

Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic
by: Ito, Sohei, et al.
Published: (2025)

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification
by: Hozzová, Petra, et al.
Published: (2024)

Verifying Global Two-Safety Properties in Neural Networks with Confidence
by: Athavale, Anagha, et al.
Published: (2024)

Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
by: Lipparini, Enrico, et al.
Published: (2023)

Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic (Technical Report)
by: Habermehl, Peter, et al.
Published: (2024)

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

Complex Algebras of Arithmetic
by: Düntsch, Ivo, et al.
Published: (2009)

DRAFT: A Formally Verified Constructive Proof of the Consistency of Peano Arithmetic Using Ordinal Assignments
by: Bryce, Aaron, et al.
Published: (2026)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)