Cover Image

Skolem and Positivity Completeness of Ergodic Markov Chains

Fuente: arXiv

Saved in:

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

Similar Items

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
by: Akshay, S., et al.
Published: (2022)

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

Skolemization In Intermediate Logics
by: Baaz, Matthias, et al.
Published: (2025)

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

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

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

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

An Approximate Skolem Function Counter
by: Shaw, Arijit, et al.
Published: (2023)

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

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

The Skolem Problem in rings of positive characteristic
by: Dong, Ruiwen, et al.
Published: (2025)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

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

Blurred Drinker Paradoxes and Blurred Choice Axioms: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem
by: Kirst, Dominik, et al.
Published: (2026)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
by: Spork, Timm, et al.
Published: (2025)

Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
by: Češka, Milan, et al.
Published: (2026)

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

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
by: Xu, Ming, et al.
Published: (2022)

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

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

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

Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators
by: Kikot, Stanislav, et al.
Published: (2017)

Positivity-hardness results on Markov decision processes
by: Piribauer, Jakob, et al.
Published: (2023)

Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

Analyzing Value Functions of States in Parametric Markov Chains
by: Engelen, Kasper, et al.
Published: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

QReach: A Reachability Analysis Tool for Quantum Markov Chains
by: Dai, Aochu, et al.
Published: (2025)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Algorithmic Randomness in Continuous-Time Markov Chains
by: Huang, Xiang, et al.
Published: (2019)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

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

Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)

The Relational Quotient Completion
by: Dagnino, Francesco, et al.
Published: (2024)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)

Model Checking Quantum Continuous-Time Markov Chains
by: Xu, Ming, et al.
Published: (2021)