The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Line minimal Boolean forests”

On Boolean modus ponens.

Sergiu Rudeanu (1998)

Mathware and Soft Computing

Similarity:

An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].

Elementary equivalence of lattices of open sets definable in o-minimal expansions of real closed fields

Vincent Astier (2013)

Fundamenta Mathematicae

Similarity:

We prove that the boolean algebras of sets definable in elementarily equivalent o-minimal expansions of real closed fields are back-and-forth equivalent, and in particular elementarily equivalent, in the language of boolean algebras with new predicates indicating the dimension, Euler characteristic and open sets. We also show that the boolean algebra of semilinear subsets of [0,1]ⁿ definable in an o-minimal expansion of a real closed field is back-and-forth equivalent to the boolean...