The authors introduce an induction-restricted sequent proof system for Transition Algebra that is compact and complete under a new semantics, supporting a model-theoretic proof of Craig interpolation.
51st International Colloquium on Automata, Languages, and Programming
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
D-institutions are reformulated using functor categories to introduce variables directly, with compound sentences as functors and a completeness theorem for the associated proof system in predicate logics.
citing papers explorer
-
Induction rules for Transition Algebra
The authors introduce an induction-restricted sequent proof system for Transition Algebra that is compact and complete under a new semantics, supporting a model-theoretic proof of Craig interpolation.
-
A formulation of D-institution using functor categories
D-institutions are reformulated using functor categories to introduce variables directly, with compound sentences as functors and a completeness theorem for the associated proof system in predicate logics.