Sciweavers

1146 search results - page 11 / 230
» Finite cupping sets
Sort
View
ICLP
1991
Springer
13 years 11 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
ISCI
2006
77views more  ISCI 2006»
13 years 7 months ago
Interaction transform for bi-set functions over a finite set
Set functions appear as a useful tool in many areas of decision making and operations research, and several linear invertible transformations have been introduced for set function...
Fabien Lange, Michel Grabisch
AML
2011
322views Mathematics» more  AML 2011»
13 years 2 months ago
A dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
Arnold W. Miller
FFA
2011
90views more  FFA 2011»
13 years 2 months ago
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of ...
Inneke Van Gelder, Gabriela Olteanu
ORDER
2010
101views more  ORDER 2010»
13 years 6 months ago
Definability in Substructure Orderings, II: Finite Ordered Sets
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 ...
Jaroslav Jezek, Ralph McKenzie