86 search results - page 1 / 18 » Definability in Substructure Orderings, II: Finite Ordered S... |
ORDER
2010
13 years 3 months ago
2010
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We ...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
ORDER
2006
13 years 4 months ago
2006
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
AAAI
2010
13 years 5 months ago
2010
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
JSYML
2008
13 years 4 months ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...