An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
| dc.contributor.author | Berardi, S | en_US |
| dc.contributor.author | Oliva, P | en_US |
| dc.contributor.author | Steila, S | en_US |
| dc.date.accessioned | 2018-01-31T15:57:06Z | |
| dc.date.available | 2015-07-27 | en_US |
| dc.date.issued | 2019-08-01 | en_US |
| dc.date.submitted | 2018-01-09T11:21:36.440Z | |
| dc.identifier.issn | 0955-792X | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/31913 | |
| dc.format.extent | 555 - 575 | en_US |
| dc.relation.ispartof | JOURNAL OF LOGIC AND COMPUTATION | en_US |
| dc.subject | Ramsey's Theorem | en_US |
| dc.subject | Termination Theorem | en_US |
| dc.subject | bar recursion | en_US |
| dc.subject | intuitionism | en_US |
| dc.subject | well-foundedness | en_US |
| dc.title | An analysis of the Podelski-Rybalchenko termination theorem via bar recursion | en_US |
| dc.type | Article | |
| dc.rights.holder | © The Author, 2015. Published by Oxford University Press. All rights reserved. | |
| dc.identifier.doi | 10.1093/logcom/exv058 | en_US |
| pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000475876600006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
| pubs.issue | 4 | en_US |
| pubs.notes | Not known | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 29 | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
