A proof-search procedure for Kuznetsov-Muravitski Logic
· 0 citations
· 33 references
Similar papers
Preprint
Sep 2026
A decision procedure for intuitionistic modal logic IS4 (and IK4)
In this paper, we show that the two intuitionistic modal logics IS4 and IK4 are decidable. We provide a constructive decision procedure, that, given a formula, produces either a proof showing the formula to be valid or a finite countermodel falsifying the formula, thus also proving the finite model property for both lo...
Marianna Girlando, Roman Kuznets, Sonia Marin et al.
· 1 citation
Proof Primitives for Equality Saturation-based Automated Provers
This work presents a proof extraction algorithm for versioned e-graphs, an extension of e-graphs that supports branching reasoning contexts and proof by cases and implements it in Vegie, a lightweight automated inductive theorem prover.
George Zakhour, J. Gabriele, Cesário et al.
· 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
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
· Reason · 0 citations
Preprint
Sep 2026
Exact Complexity of the Satisfiability Problem for Strategy Logic
We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Log...
Tikhon Pshenitsyn
· 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