Sciweavers

8768 search results - page 342 / 1754
» Generalizing the notion of support
Sort
View
ENTCS
2002
69views more  ENTCS 2002»
15 years 7 months ago
The Uniformity Principle on Traced Monoidal Categories
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
Masahito Hasegawa
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
15 years 7 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
ISCI
2002
106views more  ISCI 2002»
15 years 7 months ago
Neighborhood operator systems and approximations
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
Wei-Zhi Wu, Wen-Xiu Zhang
IANDC
1998
106views more  IANDC 1998»
15 years 7 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
MLQ
2002
95views more  MLQ 2002»
15 years 7 months ago
Invariant Logics
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
Marcus Kracht