dc.creator | Barceló Baeza, Pablo | |
dc.creator | Libkin, Leonid | |
dc.date.accessioned | 2016-09-28T19:57:26Z | |
dc.date.available | 2016-09-28T19:57:26Z | |
dc.date.created | 2016-09-28T19:57:26Z | |
dc.date.issued | 2016 | |
dc.identifier | Logical Methods in Computer Science Vol. 12(1:9)2016, pp. 1–17 | |
dc.identifier | 10.2168/MCS-12(1:6)2016 | |
dc.identifier | https://repositorio.uchile.cl/handle/2250/140550 | |
dc.description.abstract | Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, hut not actually dependent on that order relation. This is somewhat surprising since order-invariant properties are more of a. combinatorial rather than a logical object. We provide two applications of this notion. One is a proof, from the basic principles, of a, theorem by Courcelle stating that over trees, order-invariant NISO properties are expressible in IMO | |
dc.language | en | |
dc.publisher | Tech Univ Braunschweig | |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Chile | |
dc.source | Logical Methods in Computer Science | |
dc.subject | Finite model theory | |
dc.subject | Invariance | |
dc.subject | Types | |
dc.title | Order-Invariant Types and their Applications | |
dc.type | Artículo de revista | |