2023
DOI: 10.1016/j.jlamp.2022.100827
|View full text |Cite
|
Sign up to set email alerts
|

A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 45 publications
0
1
0
Order By: Relevance
“…Semantic games for choice logics have been investigated in [10] and the lifting of game-induced choice logic, GCL, to a provability game and proof system was demonstrated in [11]. Finally, following the techniques developed in [25] for analyzing sequent systems in rewrite logic, we are extending our tool [12] to also support the sequent calculi proposed here.…”
Section: Dynamic Operators and Extensionsmentioning
confidence: 99%
“…Semantic games for choice logics have been investigated in [10] and the lifting of game-induced choice logic, GCL, to a provability game and proof system was demonstrated in [11]. Finally, following the techniques developed in [25] for analyzing sequent systems in rewrite logic, we are extending our tool [12] to also support the sequent calculi proposed here.…”
Section: Dynamic Operators and Extensionsmentioning
confidence: 99%