نتایج جستجو برای: powerset theory
تعداد نتایج: 782489 فیلتر نتایج به سال:
We study the orbits under natural action of a permutation group G≤Sn on powerset
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor ...
An algorithm for the uniform random generation of the powerset construction is presented. Given a combinatorial class I, together with a counting procedure and an unranking procedure (or simply a random generation procedure) for I, this algorithm provides counting and unranking (or random generation) procedures for P = powerset(I). For most combi-natorial structures, each random powerset of siz...
This paper explores the set theoretic assumptions used in the current published proof of Fermat’s Last Theorem, how these assumptions figure in the methods Wiles uses, and the currently known prospects for a proof using weaker assumptions. Does the proof of Fermat’s Last Theorem (FLT) go beyond Zermelo Fraenkel set theory (ZFC)? Or does it merely use Peano Arithmetic (PA) or some weaker fragmen...
Concept Lattices Henry Soldano and Véronique Ventos 1 L.I.P.N, UMR-CNRS 7030, Université Paris-Nord, 93430 Villetaneuse, France 2 LRI, UMR-CNRS 8623, Université Paris-Sud, 91405 Orsay, France [email protected], [email protected] Abstract. We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language L of terms and the powerse...
Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behavioral equivalence (∼F) amongst them. Many types of transition systems and their equivalences can be captured by a functor F. For example, for deterministic automata the derived equivalence is language equivalen...
One of the continuing challenges in abstract interpretation is the creation of abstractions that yield analyses that are both tractable and precise enough to prove interesting properties about real-world programs. One source of difficulty is the need to handle programs with different behaviors along different execution paths. Disjunctive (powerset) abstractions capture such distinctions in a na...
In this paper we solve the satisfiability problem for a quantifier-free fragment of set theory involving the powerset and the singleton operators and a finiteness predicate, besides the basic Boolean set operators of union, intersection, and difference. The more restricted fragment obtained by dropping the finiteness predicate has been shown to have a solvable satisfiability problem in a previo...
In this paper we study the definition of generalized powerset of terms in the context of partially ordered monads. We provide a definition of the powerset of terms over acSLAT and study some possible directions for the definition of a partially ordered term monad.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید