:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Balasubramanian, A. R., Esparza, Javier, Raskin, Mikhail
Format:	Preprint
Published:	2020
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2010.09471
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regular Model Checking Upside-Down: An Invariant-Based Approach
by: Esparza, Javier, et al.
Published: (2022)

Complexity of Verification and Synthesis of Threshold Automata
by: Balasubramanian, A. R., et al.
Published: (2020)

Runtime Verification for LTL in Stochastic Systems
by: Esparza, Javier, et al.
Published: (2025)

Syntax Is Easy, Semantics Is Hard: Evaluating LLMs for LTL Translation
by: Danso, Priscilla Kyei, et al.
Published: (2026)

Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
by: Balasubramanian, A. R.
Published: (2024)

iSMC: A BDD-based Symbolic Model Checker with Interactive Certification
by: Czerner, Philipp, et al.
Published: (2026)

Validity of contextual formulas (extended version)
by: Esparza, Javier, et al.
Published: (2024)

Games with $ω$-Automatic Preference Relations
by: Bruyère, Véronique, et al.
Published: (2025)

The Value Problem for Multiple-Environment MDPs with Parity Objective
by: Chatterjee, Krishnendu, et al.
Published: (2025)

A Zone-Based Algorithm for Timed Parity Games
by: Geeraerts, Gilles, et al.
Published: (2025)

On the Cut Elimination of Weak Intuitionistic Tense Logic
by: Wang, Yiheng, et al.
Published: (2024)

Cut-elimination for the alternation-free modal mu-calculus
by: Afshari, Bahareh, et al.
Published: (2025)

Cut-free Deductive System for Continuous Intuitionistic Logic
by: Geoffroy, Guillaume
Published: (2025)

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)

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

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

A Cut-free Sequent Calculus for Basic Intuitionistic Dynamic Topological Logic
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Efficient Normalization of Linear Temporal Logic
by: Esparza, Javier, et al.
Published: (2023)

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

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
by: Berkholz, Christoph, et al.
Published: (2024)

Cut-Elimination for the Bimodal Logic GR
by: Kushida, Hirohiko
Published: (2026)

IMELL Cut Elimination with Linear Overhead
by: Accattoli, Beniamino, et al.
Published: (2024)

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

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

The Complexity of Nested Reset Counter Systems
by: Balasubramanian, A. R., et al.
Published: (2026)

Uniform Cut-free Bisequent Calculi for Three-valued Logics
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
by: Acclavio, Matteo, et al.
Published: (2023)

A Semantic Proof of Generalised Cut Elimination for Deep Inference
by: Atkey, Robert, et al.
Published: (2024)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

Synthesising Full-Information Protocols
by: Berwanger, Dietmar, et al.
Published: (2023)

Temporal Hyperproperties for Population Protocols
by: Waldburger, Nicolas, et al.
Published: (2024)

Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026)

Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
by: Maniwa, Akinori, et al.
Published: (2024)

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

Algorithmic Problems for Computation Trees
by: Moshkov, Mikhail
Published: (2025)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

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