Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent
Attributed to:
Boosting Automated Verification Using Cyclic Proof
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-66902-1_18
Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85029468734
Type: Book Chapter
Book Title: Automated Reasoning with Analytic Tableaux and Related Methods (2017)
Page Reference: 295-310