Computing finite models using free Boolean generators
نویسندگان
چکیده
A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted by this procedure. Particularly, using a translation of first order predicate formulas to propositional formulas, we give a method for constructing and counting finite models of the first order theories. An implementation of the method that can be run on multi-core CPUs as well as on highly parallel GPUs is outlined.
منابع مشابه
A Simple Finite Element Procedure for Free Vibration and Buckling Analysis of Cracked Beam-Like Structures
In this study, a novel and very simple finite element procedure is presented for free vibration and buckling analysis of slim beam-like structures damaged by edge cracks. A cracked region of a beam is modeled using a very short element with reduced second moment of area (I). For computing reduced I in a cracked region, the elementary theory of bending of beams and local flexibility approach are...
متن کاملPlanar sublattices of FM ( 4 )
R. McKenzie, A. Kostinsky and B. J6nsson have proved the remarkable result that the class of finite sublattices of a free lattice and the class of finite projective lattices coincide [6]. I f we restrict ourselves to modular lattices, the above result is no longer true. Examining the map from the free modular lattice on three generators, FM(3), to the free distributive lattice on three generato...
متن کاملFinite Monadic Algebras
Introduction. The elementary structure theory for finite Boolean algebras is, for our purposes, summarized in the following theorem, (see [1, p. 163], or [2, p. 344]). (*) If B is a finite Boolean algebra, then it is completely characterized by the number of its elements, a number which must be of the form 2", where n is the number of atoms of B. In this case B is faithfully represented as the ...
متن کاملFREE ALGEBRAS IN VARIETIES OF BL-ALGEBRAS GENERATED BY A BLn-CHAIN
Free algebras with an arbitrary number of free generators in varieties of BL-algebras generated by one BL-chain that is an ordinal sum of a finite MV-chain Ln and a generalized BL-chain B are described in terms of weak Boolean products of BL-algebras that are ordinal sums of subalgebras of Ln and free algebras in the variety of basic hoops generated by B. The Boolean products are taken over the...
متن کاملFinitely Presented Heyting Algebras
In this paper we study the structure of finitely presented Heyting algebras. Using algebraic techniques (as opposed to techniques from proof-theory) we show that every such Heyting algebra is in fact coHeyting, improving on a result of Ghilardi who showed that Heyting algebras free on a finite set of generators are co-Heyting. Along the way we give a new and simple proof of the finite model pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.6978 شماره
صفحات -
تاریخ انتشار 2013