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.
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· Electronic Proceedings in Th...· 0 citations
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...
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.
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.
It is proved that every confluent transition system admits a locally decreasing labeling using only three labels, which can, in principle, certify the confluence of every confluent system, and hence of every confluent program.
J. Endrullis, Ievgen Ivanov, F. van Raamsdonk· 0 citations
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.
