Cover Image

Algorithmic Problems for Computation Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Moshkov, Mikhail
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Programs Versus Finite Tree-Programs
by: Moshkov, Mikhail
Published: (2025)

Modelling of logical systems by means of their fragments
by: Rybakov, Mikhail
Published: (2025)

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

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
by: Livson, Ori, et al.
Published: (2025)

Computing Witnesses Using the SCAN Algorithm
by: Achammer, Fabian, et al.
Published: (2026)

The Discontinuity Problem
by: Brattka, Vasco
Published: (2020)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
by: Achammer, Fabian, et al.
Published: (2025)

Problems and Consequences of Bilateral Notions of (Meta-)Derivability
by: Ayhan, Sara
Published: (2025)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

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

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

MCAC: A Model Counting Algorithm for Exact Computation of Error Metrics of Approximate Circuits
by: Ramprasath, S, et al.
Published: (2024)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
by: Niwiński, Damian, et al.
Published: (2023)

SAT-based Learning of Computation Tree Logic
by: Pommellet, Adrien, et al.
Published: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
by: Kojima, Ryota, et al.
Published: (2025)

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

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)

Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models
by: George, Anne-Marie, et al.
Published: (2024)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

Logics and Algorithms for Hyperproperties
by: Finkbeiner, Bernd
Published: (2025)

Mathematical Informatics: Algorithms
by: Seiller, Thomas
Published: (2026)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
by: Badihian, Neema Rustin
Published: (2025)

$ω$-Regular Energy Problems
by: Dziadek, Sven, et al.
Published: (2022)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
by: Balasubramanian, A. R., et al.
Published: (2020)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Algorithmic Perspective on Toda's Theorem
by: Fried, Dror, et al.
Published: (2025)

Algorithms for Markov Binomial Chains
by: Gonzalez, Alejandro Alarcón, et al.
Published: (2024)

Computation and Concurrency
by: Wang, Yong
Published: (2024)

Implication Problems over Positive Semirings
by: Hirvonen, Minna
Published: (2025)

On Efficient Algorithms For Partial Quantifier Elimination
by: Goldberg, Eugene
Published: (2024)

Compositional Reversible Computation
by: Carette, Jacques, et al.
Published: (2024)

Probabilistic Strategies: Definability and the Tensor Completeness Problem
by: Bowler, Nathan, et al.
Published: (2025)

On Reconfigurable Bisimulation, with an Application to the Distributed Synthesis Problem
by: Alrahman, Yehia Abd, et al.
Published: (2025)