Sciweavers

815 search results - page 26 / 163
» Algebraic Recognizability of Languages
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
14 years 12 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
CSL
2008
Springer
15 years 1 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
ENTCS
2008
87views more  ENTCS 2008»
14 years 12 months ago
Process Algebra with Local Communication
In process algebras like CRL and ACP communication is defined globally. In the context of component-based architectures one wishes to define subcomponents of a system separately, ...
Muck van Weerdenburg
IGPL
2011
14 years 3 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
TOOLS
1999
IEEE
15 years 4 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee