The One-Variable Fragment of T→
| dc.contributor.author | Slaney, John K | |
| dc.contributor.author | Walker, Edward | |
| dc.date.accessioned | 2015-12-10T23:20:09Z | |
| dc.date.issued | 2013 | |
| dc.date.updated | 2015-12-10T10:21:00Z | |
| dc.description.abstract | We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of “ticket entailment” proposed by Anderson and Belnap. This answers a question posed by R. K. Meye | |
| dc.identifier.issn | 0022-3611 | |
| dc.identifier.uri | http://hdl.handle.net/1885/66194 | |
| dc.publisher | Kluwer Academic Publishers | |
| dc.source | Journal of Philosophical Logic | |
| dc.title | The One-Variable Fragment of T→ | |
| dc.type | Journal article | |
| local.bibliographicCitation.lastpage | 12 | |
| local.bibliographicCitation.startpage | 1 | |
| local.contributor.affiliation | Slaney, John K, College of Engineering and Computer Science, ANU | |
| local.contributor.affiliation | Walker, Edward, College of Engineering and Computer Science, ANU | |
| local.contributor.authoremail | u8800435@anu.edu.au | |
| local.contributor.authoruid | Slaney, John K, u8800435 | |
| local.contributor.authoruid | Walker, Edward, u5024447 | |
| local.description.embargo | 2037-12-31 | |
| local.description.notes | Imported from ARIES | |
| local.identifier.absfor | 080201 - Analysis of Algorithms and Complexity | |
| local.identifier.absseo | 970108 - Expanding Knowledge in the Information and Computing Sciences | |
| local.identifier.ariespublication | u4334215xPUB1240 | |
| local.identifier.citationvolume | 2013 | |
| local.identifier.doi | 10.1007/s10992-013-9293-3 | |
| local.identifier.scopusID | 2-s2.0-84912046415 | |
| local.identifier.uidSubmittedBy | u4334215 | |
| local.type.status | Published Version |