Skip to content

Completing Almost Fair Simulations

2026 · International Conference on Interactive Theorem Proving · pp. 20:1-20:20 · 1 citation · 21 references
Computer Science

TL;DR

This paper presents a new deductive system for language inclusion of Büchi automata that preserves the simplicity of Almost Fair Simulations, with the additional benefit of being complete for fair similarity.

View source

Similar papers

Open access Sep 2026

Domain Theory Meets Interaction Trees in Rocq

We present a domain-theoretical formalization of interaction trees in the Rocq prover. Unlike existing formalizations, ours does not rely on Rocq's built-in coinduction. Hence, we avoid complications occurring in earlier works, such as artificially including silent steps to comply with Rocq's productivity checker, trea...

David Nowak, Vlad Rusu · 0 citations
Open access Aug 2026

Gentzen systems and Beth tableaux

This paper provides an expository comparison of two foundational proof systems in classical propositional logic: Gentzen's sequent calculus and Beth's semantic tableaux. Gentzen's sequent calculus is presented as a rule-based system built upon the single axiom $\alpha \Rightarrow \alpha$, whose key feature — the subfor...

Zuzanna Rygiewicz · 0 citations
Preprint Sep 2026

Towards a Proof-Theoretic Analysis of Incorrect/Incomplete Proofs

It is shown that the epsilon calculus provides a natural framework for analyzing tolerance of falsity in proofs and for identifying conditions under which an incorrect proof can be semantically repaired.

Matthias Baaz, Mariami Gamsakhurdia · 0 citations

Arbitrary-arity Tree Automata for QCTL 1

A new class of automata running on infinite trees of arbitrary arity is introduced, and several algorithms to perform classical operations are developed for those automata and precisely characterise their complexities.

François Laroussinie, Nicolas Markey · 0 citations
Preprint Oct 2026

Decreasing Diagrams are Complete for Confluence

Confluence is a fundamental property of nondeterministic computations, arising from parallelism, concurrency, or freedom in the evaluation order. It guarantees that such a computation always yields the same result, regardless of the order in which steps are taken. The decreasing diagrams technique of van Oostrom is one...

J. Endrullis, Ievgen Ivanov, F. van Raamsdonk · 0 citations

GenZ: A Generic Sequent Calculus Prover using the Zipper

GenZ is introduced, a generic theorem prover for sequent calculi implemented in Haskell that allows the user to specify a set of sequent rules, over which it performs proof search, and employs the zipper data structure.

Xiaoshuang Yang, Malvin Gattinger, Marianna Girlando et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.