Image de couverture de livre

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Nakamura, Yoshiki
Format:	Preprint
Publié:	2025
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 Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
par: Nakamura, Yoshiki
Publié: (2025)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
par: Nakamura, Yoshiki
Publié: (2026)

Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure
par: Nakamura, Yoshiki
Publié: (2024)

On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation
par: Nakamura, Yoshiki
Publié: (2023)

Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity
par: Nakamura, Yoshiki
Publié: (2023)

Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
par: Nakamura, Yoshiki
Publié: (2023)

On the Relative Completeness of Satisfaction-based Probabilistic Hoare Logic With While Loop
par: Sun, Xin, et autres
Publié: (2024)

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

Undecidability of theories of semirings with fixed points
par: Das, Anupam, et autres
Publié: (2025)

An Undecidability Proof for the Plan Existence Problem
par: Achilleos, Antonis
Publié: (2026)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
par: Chodil, Miroslav, et autres
Publié: (2025)

The Undecidability of Quantified Announcements
par: Ågotnes, Thomas, et autres
Publié: (2024)

Accelerating Loops with Arrays
par: Frohn, Florian, et autres
Publié: (2026)

Words-to-Letters Valuations for Language Kleene Algebras with Variable and Constant Complements
par: Nakamura, Yoshiki, et autres
Publié: (2024)

Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
par: Nakamura, Yuki
Publié: (2026)

Termination of Triangular Polynomial Loops
par: Hark, Marcel, et autres
Publié: (2019)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
par: Lommen, Nils, et autres
Publié: (2022)

Undecidability of Linear Logics without Weakening
par: Suzuki, Jun, et autres
Publié: (2025)

Nonlinear Arithmetic with SMTLIB Division is Undecidable
par: Jovanovic, Dejan
Publié: (2026)

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

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

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Some General Completeness Results for Propositionally Quantified Modal Logics
par: Ding, Yifeng, et autres
Publié: (2024)

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
par: Lyon, Tim S.
Publié: (2024)

Systemic Constraints of Undecidability
par: Bulin, Seth
Publié: (2025)

Integrating Loop Acceleration into Bounded Model Checking
par: Frohn, Florian, et autres
Publié: (2024)

Termination of Real Linear Loops
par: Neumann, Eike, et autres
Publié: (2026)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2022)

Guarded Negation Transitive Closure Logic
par: Figueira, Diego, et autres
Publié: (2025)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
par: Chistikov, Dmitry, et autres
Publié: (2024)

On Propositional Dynamic Logic and Concurrency
par: Acclavio, Matteo, et autres
Publié: (2024)

Intuitionistic Propositional Logic in Lean
par: Trufaş, Dafina
Publié: (2024)

Propositional Logics for the Lawvere Quantale
par: Bacci, Giorgio, et autres
Publié: (2023)

Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
par: Dudenhefner, Andrej
Publié: (2026)

On the Cut Elimination of Weak Intuitionistic Tense Logic
par: Wang, Yiheng, et autres
Publié: (2024)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
par: Fortin, Marie, et autres
Publié: (2023)

On Formally Undecidable Traits of Intelligent Machines
par: Fox, Matthew
Publié: (2024)

The General and Finite Satisfiability Problems for PCTL are Undecidable
par: Chodil, Miroslav, et autres
Publié: (2024)

Linear Loop Synthesis for Quadratic Invariants
par: Hitarth, S., et autres
Publié: (2023)

A Fixed-Parameter Study on Propositional Dynamic Logic
par: Hosseinpour, Mohammad Javad, et autres
Publié: (2024)