「Boolean」の共起表現(1語右で並び替え)

意味
共起
表現

「Boolean」の共起表現一覧(1語右で並び替え)

Boolean

1語右で並び替え

該当件数:172件

published a sophisticated arithmetization of boolean algebra based on Dedekind's ideal theory and
The Boolean algebra 2Σ* of all formal languages over an a
In the Boolean algebra of the power set of a set S, a subset
g Circuits, Claude Elwood Shannon proved that Boolean algebra and binary arithmetic could be used t
rm the Stone representation of its underlying Boolean algebra and then extend this to a topological
Is Boolean algebra all about minimizing functions?
This Boolean algebra is unique up to isomorphism.
In mathematics, a residuated Boolean algebra is a residuated lattice whose lattice
In fact, any skew Boolean algebra can be embedded into such an algebra.
lation algebra can be defined as a residuated Boolean algebra having an operation x satisfying thes
is the set Matn(B) of square matrices over a boolean algebra B, where the matrices are ordered poi
tone's representation theorem states that any Boolean algebra B is isomorphic to the algebra of clo
For any Boolean algebra B, S(B) is a compact totally disconne
apparatus of asynchronous logic is served by Boolean algebra as well as by algebraic instruments o
Ph.D. (1965) in mathematics (Some studies in Boolean algebra) from the Karnataka University, Dharw
e in canonical form with the addition of some Boolean algebra, costing just 2 gate delays for each
is a Boolean algebra,
ole, the famous mathematician and inventor of Boolean algebra, lived in Ballintemple during the 19t
ections, one for basic algebra, the other for Boolean algebra.
non expansion theorem is an important idea in Boolean algebra.
Her main interest in math was in the field of Boolean algebra.
X that are clopen (both closed and open) is a Boolean algebra.
do (1), (2), and (4) form a basis for Boolean algebra?
tion then becomes: Is every Robbins algebra a Boolean algebra?
here exist interesting examples of residuated Boolean algebras that are not relation algebras, such
at there is a duality between the category of Boolean algebras and the category of Stone spaces.
Examples include Boolean algebras with the monoid taken to be conjunct
rem that the supposedly loose analogy between boolean algebras and rings could in fact be formulate
propositional modal logics in the same way as Boolean algebras are models of classical logic.
The class of boolean algebras characterizes classical propositiona
that in addition to the isomorphisms between Boolean algebras and their Stone spaces, each homomor
trength of the Sikorski Extension Theorem for Boolean Algebras", Journal of Symbolic Logic 48, 1983
ivalent to the Sikorski Extension Theorem for Boolean Algebras", Fundamenta Mathematicae, 130, 1988
rs, numerous papers on ordered structures and Boolean algebras, and in 1977 published Jean Piaget:
existed prior to the general concept, include Boolean algebras, Heyting algebras, residuated Boolea
is characterized by the class of topological boolean algebras-that is, boolean algebras with an in
-known Stone duality between Stone spaces and Boolean algebras.
generalization of the Stone representation of Boolean algebras.
k demonstrated that Nucline RNA could perform Boolean and arithmetic operations (If-then-else, AND
ead, because the if-condition must be of type boolean, and there is no implicit way to convert from
Egothor supports both Boolean and vector search.
Keystroke programmable with full boolean and program control command sets and line edi
Kinetic logic: a Boolean approach to the analysis of complex regulator
ators (e.g., arithmetic, equality/inequality, Boolean) are counted.
local boolean array booleans
m (which proves that, if SAT can be solved by Boolean circuits with a polynomial number of logic ga
thout Death can be used to simulate arbitrary Boolean circuits: the presence or absence of a ladder
d be considered essential to test a candidate Boolean combination function for correlation immunity
fe streaming data, such as stock ticks in one boolean condition.
In the theory of relational databases, a Boolean conjunctive query is a conjunctive query with
the earliest languages to provide an explicit Boolean data type was ALGOL 60 (1960) with values tru
programming languages that include a distinct boolean data type in their type system, like Java, th
In programming languages that have a built-in Boolean data type, such as Pascal and Java, the compa
coincide on enumerated datatypes such as the boolean datatype.
Boolean, DateTime, Decimal, Float, Integer and String
positive and negative cofactors of f, and the boolean derivation of f.
If the Boolean domain is viewed as a semiring, where additio
where X is an arbitrary set and where B is a boolean domain.
terms 2 and 6) one can "reduce" the example's Boolean equation i.e. (x'y'z' + x'y'z) + (x'yz' + xyz
is described in the behaviour perspective by boolean equations.
will fill it depending on the outcome of the boolean expression.
Boolean expressions are represented very similarly to
hs were originally used for analyzing complex Boolean expressions.
d ANF and ORF for Short-circuit evaluation of Boolean expressions.
o set a subscription expiry time and a custom boolean filter.
blem, as any NP machine can be encoded into a Boolean formula by a process similar to that in Cook'
Every k-ary Boolean formula can be expressed as a propositional f
ean satisfiability problem and the quantified boolean formula problem.
ficial game represented by a fully quantified Boolean formula.
nction for linear feedback shift registers, a Boolean function with low-order correlation-immunity
node at time t+1 is computed by applying the boolean function associated with the node to the stat
necessary but not sufficient condition for a Boolean function to be appropriate for use in a keyst
e ( this can be avoided by using the IsDbNull boolean function of the DataReader class ).
An example of a balanced boolean function is the function that assigns a 1 to
r showed that the correlation immunity m of a Boolean function of algebraic degree d of n variables
Boolean function
Finitary boolean function
mathematics and computer science, a balanced boolean function is a boolean function whose output y
The sum of all prime implicants of a Boolean function is called the complete sum of that f
An n-bit LUT can encode any n-input Boolean function by modeling such functions as truth
The dual canonical forms of any Boolean function are a "sum of minterms" and a "produ
In mathematics, the correlation immunity of a Boolean function is a measure of the degree to which
For example, a Boolean function which has no first order or second o
(or Davio) expansion is a decomposition of a boolean function.
dware description language, used to translate Boolean functions and state transition tables into a
Boolean functions are often represented by sentences
Balanced boolean functions are primarily used in cryptography.
From any two monotone Boolean functions f and g we can find two other monot
The free distributive lattices of monotonic Boolean functions on 0, 1, 2, and 3 arguments (move m
In cooperative game theory, Boolean functions are called simple games (voting gam
The properties of Boolean functions play a critical role in cryptograph
Boolean Functions: Theory, Algorithms and Application
urvich, Read-once functions, (book chapter in Boolean Functions: Theory, Algorithms and Application
er extension of conjunctive grammars known as Boolean grammars additionally allows explicit negatio
Boolean inUse;
This rule is equivalent to Boolean involution.
public static boolean isInteger(Object o) {
public static boolean isValidCC(String number) {
boolean isValidMove(int theFromFile, int theFromRank,
vertex in V represents the truth status of a Boolean literal, and each directed edge from vertex u
This is an efficient way of encoding Boolean logic functions, and LUTs with 4-6 bits of in
Boolean logic, is used for the design of computer cir
This index is searched using a boolean matching algorithm like most other text index
Incidence matrix - A two-dimensional Boolean matrix, in which the rows represent the verti
The first Boolean networks were proposed by Stuart A. Kauffman
ositional variables are connected by means of Boolean operations - conjunction, disjunction and neg
Boolean operations of and, or and not.
The exact agreement with the number of boolean operations on n variables, which exhaust the
om a finite set of halfplanes (halfspaces) by Boolean operations of set intersection and set comple
Since other Boolean operations, such as union or difference, may
Boolean operations, such as difference or intersectio
etters of the alphabet, the empty set symbol, boolean operators and concatenation but no Kleene sta
rthy evaluation denotes the semantics of some Boolean operators in some programming languages in wh
some programming languages (Lisp), the usual Boolean operators are short-circuit.
(Java, Ada), both short-circuit and standard Boolean operators are available.
onally complete set of logical connectives or Boolean operators is one which can be used to express
orates additional search capabilities such as Boolean operators, as well as the ability to search o
In computer science, the Boolean or logical data type is a data type, having t
The Scannerless Boolean Parser is a free software scannerless GLR par
atical rules governing the order of elements, Boolean predicates that the content must satisfy, dat
(and coherent maps), on the assumption of the Boolean prime ideal theorem (in fact, this statement
s to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of
fference logic -- ASP is at best suitable for boolean problems that reduce to the free theory of un
arkable speedups in solving a wide variety of boolean problems.
In mathematical logic, given an unsatisfiable boolean propositional formula in conjunctive normal f
l case are the logics that allow second-order Boolean propositions, where quantifiers may range eit
Boolean queries on keywords
this architecture gives the responsibility of Boolean reasoning to the DPLL-based SAT solver which,
Almost any boolean reasoning problem can be expressed as a SAT p
Boolean Rings.
to multiplication as in the ring structure of Boolean rings.
ly implemented as a model-finder built atop a boolean SAT solver.
is one of the optimization extensions of the boolean satisfiability problem, which is the problem
The boolean satisfiability problem can be viewed as the s
presented in the well-known conference on the boolean satisfiability problem and related problems,
s the recent emergence of much more efficient boolean satisfiability (SAT) solvers.
is an algorithm for solving instances of the Boolean satisfiability problem in programming.
Sharp-SAT, a function problem related to the Boolean satisfiability problem, is the problem of cou
to it from the SAT solver as it explores the Boolean search space of the formula.
rent search systems (phrase, set of terms, or boolean search query) and immediately jump to related
GUI Boolean search build tool.
Boolean search engines typically only return items wh
kinds of text search, including exact search, boolean search, wildcard search, linguistic search (g
arch (from single-word to arbitrarily complex boolean searches) in a friendly GUI, with minimum tec
Powerful query facilities, with boolean searches, wildcards, phrases, proximity, filt
Although originally designed for answering Boolean selection queries, GiST can also support near
ator in scalar context as a stateful bistable Boolean test, roughly equivalent to "true while x but
A Boolean thesaurus is available to expand or limit que
// set the variant to a boolean true
e strings of characters, signed integers, and boolean truth values, or more simply strings, integer
lass data types: atom, integer, real, string, boolean, tuple, set.
on to the bit-vector type C-- also provides a Boolean type bool, which can be computed by expressio
a boolean type (G_TYPE_BOOLEAN);
unsigned types, and as one would expect for a boolean type, such a conversion is 0 if and only if t
new keyword, _Bool, is introduced as the new boolean type.
C programmers got used to defining their own Boolean types as such, for readability reasons.
Conversion of Boolean value True to Integer may yield -1 or 1 depen
In the lambda calculus model of computing, Boolean values can be represented as Church booleans.
Boolean values, representing true or false
As with boolean values, the C standard library includes a mac
The condition alternatives are simple Boolean values, and the action entries are check-mark
Executing a subprogram until a boolean variable is true (repetition)
f two subprograms according to the value of a boolean variable (selection)