Results 1  10
of
223,145
WHAT IS BOOLEAN VALUED ANALYSIS?
, 2006
"... Abstract. This is a brief overview of the basic techniques of Boolean valued analysis. 1. ..."
Abstract
 Add to MetaCart
Abstract. This is a brief overview of the basic techniques of Boolean valued analysis. 1.
Booleanvalued Term Models
, 2007
"... We construct Booleanvalued term models and describe their universal properties. The underlying set of these models consists of the terms of the underlying language, while formulae are interpreted in the LindenbaumTarski algebra of open formulae. Subspaces of the Stone space of the LindenbaumTarsk ..."
Abstract
 Add to MetaCart
We construct Booleanvalued term models and describe their universal properties. The underlying set of these models consists of the terms of the underlying language, while formulae are interpreted in the LindenbaumTarski algebra of open formulae. Subspaces of the Stone space of the Lindenbaum
Boolean Valued Analysis and Positivity
"... A. G. Ku s r aev an d S. S. Ku tatelad ze ( R u s s ia) Abstract. T his is an overview of the recent results of interaction of B o olean valued analysis and vector lattice theory. ..."
Abstract
 Add to MetaCart
A. G. Ku s r aev an d S. S. Ku tatelad ze ( R u s s ia) Abstract. T his is an overview of the recent results of interaction of B o olean valued analysis and vector lattice theory.
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Abstract—This is a brief overview of the basic techniques of Boolean valued analysis.
, 2006
"... The term “Boolean valued analysis ” appeared within the realm of mathematical logic. It was Takeuti, a renowned expert in proof theory, who introduced the term. Takeuti defined Boolean valued analysis in [18, p. 1] as “an application of Scott–Solovay’s Boolean valued models of set theory to analysis ..."
Abstract
 Add to MetaCart
The term “Boolean valued analysis ” appeared within the realm of mathematical logic. It was Takeuti, a renowned expert in proof theory, who introduced the term. Takeuti defined Boolean valued analysis in [18, p. 1] as “an application of Scott–Solovay’s Boolean valued models of set theory
Predicate Calculus for Boolean Valued Functions. Part VIII Shunichi Kobayashi
, 1999
"... Summary. In this paper, we proved some elementary predicate calculus formulae containing the quantifiers of Boolean valued functions with respect to partitions. Such a theory is an analogy of usual predicate logic. MML Identifier: BVFUNC16. WWW: ..."
Abstract
 Add to MetaCart
Summary. In this paper, we proved some elementary predicate calculus formulae containing the quantifiers of Boolean valued functions with respect to partitions. Such a theory is an analogy of usual predicate logic. MML Identifier: BVFUNC16. WWW:
BooleanValued Introduction to the Theorv of Vector Lattices
"... The theory of vector lattices appeared in early thirties of this century and is connected with the names of L. V. Kantorovich, F. Riesz, and H. Freudenthal. The study of vector spaces equipped with an order relation compatible with a given norm ..."
Abstract
 Add to MetaCart
The theory of vector lattices appeared in early thirties of this century and is connected with the names of L. V. Kantorovich, F. Riesz, and H. Freudenthal. The study of vector spaces equipped with an order relation compatible with a given norm
Leibnizian, Robinsonian, and Boolean Valued Monads*1
, 2011
"... Abstract—This is an overview of the presentday versions of monadology with some applications to vector lattices and linear inequalities. Two approaches to combining nonstandard settheoretic models are sketched and illustrated by order convergence, principal projection, and polyhedrality. ..."
Abstract
 Add to MetaCart
Abstract—This is an overview of the presentday versions of monadology with some applications to vector lattices and linear inequalities. Two approaches to combining nonstandard settheoretic models are sketched and illustrated by order convergence, principal projection, and polyhedrality.
Predicate Calculus for Boolean Valued Functions. Part XII Shunichi Kobayashi
"... Summary. In this paper, we proved some elementary predicate calculus formulae containing the quantifiers of Boolean valued functions with respect to partitions. Such a theory is an analogy of ordinary predicate logic. MML Identifier: BVFUNC24. ..."
Abstract
 Add to MetaCart
Summary. In this paper, we proved some elementary predicate calculus formulae containing the quantifiers of Boolean valued functions with respect to partitions. Such a theory is an analogy of ordinary predicate logic. MML Identifier: BVFUNC24.
Results 1  10
of
223,145