%0 Conference Paper %1 conf/tableaux/RoweB17 %A Rowe, Reuben N. S. %A Brotherston, James %B TABLEAUX %D 2017 %E Schmidt, Renate A. %E Nalon, Cláudia %I Springer %K dblp %P 295-310 %T Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. %U http://dblp.uni-trier.de/db/conf/tableaux/tableaux2017.html#RoweB17 %V 10501 %@ 978-3-319-66902-1

@inproceedings{conf/tableaux/RoweB17, added-at = {2024-02-05T00:00:00.000+0100}, author = {Rowe, Reuben N. S. and Brotherston, James}, biburl = {https://www.bibsonomy.org/bibtex/2dc104cf7a4aa412b5a217667c4163fe7/dblp}, booktitle = {TABLEAUX}, crossref = {conf/tableaux/2017}, editor = {Schmidt, Renate A. and Nalon, Cláudia}, ee = {https://doi.org/10.1007/978-3-319-66902-1_18}, interhash = {fa474d976457fc00f73f3fd0e54edd5b}, intrahash = {dc104cf7a4aa412b5a217667c4163fe7}, isbn = {978-3-319-66902-1}, keywords = {dblp}, pages = {295-310}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T05:42:04.000+0200}, title = {Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent.}, url = {http://dblp.uni-trier.de/db/conf/tableaux/tableaux2017.html#RoweB17}, volume = 10501, year = 2017 }