Sciweavers

6 search results - page 1 / 2
» More on Cardinal Invariants of Boolean Algebras
Sort
View
APAL
2000
84views more  APAL 2000»
13 years 5 months ago
More on Cardinal Invariants of Boolean Algebras
We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that ir...
Andrzej Roslanowski, Saharon Shelah
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 5 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
JAR
2006
236views more  JAR 2006»
13 years 5 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CADE
2005
Springer
14 years 5 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CADE
2007
Springer
14 years 5 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard