dc.contributor.author |
Kellerman, Ruaan
|
|
dc.date.accessioned |
2015-09-16T11:45:22Z |
|
dc.date.available |
2015-09-16T11:45:22Z |
|
dc.date.issued |
2015-08 |
|
dc.description.abstract |
Tree paths are investigated using first-order logic. The following
results are obtained: (i) every definable path can be defined by a firstorder
formula using at most one parameter chosen from the path itself;
(ii) a canonical representation of the formulas that define definable
paths is obtained; and (iii) every tree that has only finitely many paths
that are not definable is n-equivalent to a tree of which all paths are
definable. Moreover, a certain property that might be expected to
hold, involving the transfer of n-equivalence between trees, is shown
not to be true. |
en_ZA |
dc.description.embargo |
2016-08-31 |
en_ZA |
dc.description.librarian |
hb2015 |
en_ZA |
dc.description.uri |
http://biomedgerontology.oxfordjournals.org |
en_ZA |
dc.identifier.citation |
Kellerman, R 2015, 'First-order aspects of tree paths', Logic Journal of the IGPL, vol. 23, no. 4, pp. 688-704. |
en_ZA |
dc.identifier.issn |
1367-0751 (print) |
|
dc.identifier.issn |
1368-9894 (online) |
|
dc.identifier.other |
10.1093/jigpal/jzv026 |
|
dc.identifier.uri |
http://hdl.handle.net/2263/49950 |
|
dc.language.iso |
en |
en_ZA |
dc.publisher |
Oxford University Press |
en_ZA |
dc.rights |
© The Author 2015. Published by Oxford University Press. All rights reserved. This is a pre-copy-editing, author-produced PDF of First-order aspects of tree paths in Logic Journal of the IGPL, vol. 23, no. 4, pp. 688-704, 2015. doi : 10.1093/jigpal/jzv026. The definitive publisher-authenticated version is available online at : http//jigpal.oxfordjournals.org. |
en_ZA |
dc.subject |
Tree paths |
en_ZA |
dc.subject |
First-order logic |
en_ZA |
dc.title |
First-order aspects of tree paths |
en_ZA |
dc.type |
Postprint Article |
en_ZA |