Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

Longer titles found: Boolean-valued (view), Boolean-valued function (view), Boolean-valued model (view), Boolean Pythagorean triples problem (view), Boolean algebra (view), Boolean algebra (disambiguation) (view), Boolean algebra (structure) (view), Boolean algebras canonically defined (view), Boolean analysis (view), Boolean circuit (view), Boolean conjunctive query (view), Boolean data type (view), Boolean delay equation (view), Boolean differential calculus (view), Boolean domain (view), Boolean expression (view), Boolean flag (view), Boolean function (view), Boolean grammar (view), Boolean hierarchy (view), Boolean matrix (view), Boolean model (probability theory) (view), Boolean model of information retrieval (view), Boolean network (view), Boolean operation (view), Boolean operations on polygons (view), Boolean prime ideal theorem (view), Boolean ring (view), Boolean satisfiability algorithm heuristics (view), Boolean satisfiability problem (view), Minimal axioms for Boolean algebra (view), List of Boolean algebra topics (view), Complete Boolean algebra (view), True quantified Boolean formula (view), Two-element Boolean algebra (view), Stone's representation theorem for Boolean algebras (view), Advanced Boolean Expression Language (view), Free Boolean algebra (view), Pseudo-Boolean function (view), Monadic Boolean algebra (view), Evasive Boolean function (view), Residuated Boolean algebra (view), Balanced Boolean function (view), Symmetric Boolean function (view), Scannerless Boolean Parser (view), Topological Boolean algebra (view), Inclusion (Boolean algebra) (view), Analysis of Boolean functions (view)

searching for Boolean 86 found (3000 total)

alternate case: boolean

Full-text search (1,572 words) [view diff] exact match in snippet view article find links to article

within a stored data record, such as "Title" or "Author." Boolean queries. Searches that use Boolean operators (for example, "encyclopedia" AND "online" NOT

arrays are composed with matrix multiplication where the arithmetic is Boolean, and such a composition represents composition of relations. Although most

compact sets). In addition, solids are required to be closed under the Boolean operations of set union, intersection, and difference (to guarantee solidity

search engines support the use of the Boolean operators AND, OR and NOT to help end users refine the search query. Boolean operators are for literal searches

search engines support the use of the Boolean operators AND, OR and NOT to help end users refine the search query. Boolean operators are for literal searches

in 1999, and can be used to compute values (e.g., strings, numbers, or Boolean values) from the content of an XML document. Support for XPath exists in

the branch of mathematics concerned with systems of linear equations. In Boolean algebra, a linear function is a function f {\displaystyle f} for which

its negation, truth. Usual notations of the false are 0 (especially in Boolean logic and computer science), O (in prefix notation, Opq), and the up tack

general, gene-regulation functions do not use Boolean logic, although in some cases the approximation of the Boolean logic is still very useful.[citation needed]

called a linearly separable Boolean function, or threshold Boolean function. The sequence of numbers of threshold Boolean functions on n inputs is OEIS

Analysis of Logic' that describes an algebraic system of logic, now known as Boolean algebra. Boole's system was based on binary, a yes-no, on-off approach

x^{\mathsf {Boolean}}\lambda y^{\mathsf {Boolean}}{.}x\,{\mathsf {Boolean}}\,y\,\mathbf {F} \\\mathrm {OR} &=\lambda x^{\mathsf {Boolean}}\lambda y^{\mathsf

x^{\mathsf {Boolean}}\lambda y^{\mathsf {Boolean}}{.}x\,{\mathsf {Boolean}}\,y\,\mathbf {F} \\\mathrm {OR} &=\lambda x^{\mathsf {Boolean}}\lambda y^{\mathsf

2123: attempt to index a boolean value. Lua error in Module:Citation/CS1/Configuration at line 2123: attempt to index a boolean value. Lua error in

backscan older copies. Added value services are also available, which allow Boolean search, alerts on new legislation regarding subjects defined by the user

a vast range of geometrical and topological algorithms (intersection, Boolean operations, surface meshing, fillets, shape healing). Visualization (rendering)

C, to answer set programs. Since modern answer-set solvers make use of boolean SAT algorithms to very rapidly ascertain satisfiability, this implies that

states that the bias (deviation of the expected value from 1/2) of a linear Boolean function (XOR-clause) of independent binary random variables is related

evaluate to the value true in a Boolean expression. (R5RS sec. 6.3.1) Where the constant representing the Boolean value of true is T in most Lisps,

slideshows, annotation, KIPI plugin support for manipulating images, and Boolean searches. KPhotoAlbum is licensed under the GPL-2.0-or-later license. Jesper

standard calls for a Boolean type,. IBM Db2 supports boolean values since around 11.1. Microsoft SQL Server supports storage for booleans using "BIT" data

NOT NULL constraint, the SQL BOOLEAN works like the Boolean type from other languages. Unrestricted, however, the BOOLEAN datatype, despite its name, can

chemical structures that have either been uploaded or drawn. Additional Boolean searches can be combined with structure search to include other fields

geometry) : boolean ST_Disjoint(geometry, geometry) : boolean ST_Intersects(geometry, geometry) : boolean ST_Touches(geometry, geometry) : boolean ST_Crosses(geometry

"true" -> Boolean "false" -> Boolean lhs:Boolean "|" rhs:Boolean -> Boolean {left} lhs:Boolean "&" rhs:Boolean -> Boolean {left} "not" "(" Boolean ")" ->

controlled vocabulary); electronic versions typically support keyword and Boolean queries. Union catalogs are useful to librarians, as they assist in locating

′ when illustrating the minterms e.g. x′ =defined NOT x, + for Boolean OR (from Boolean algebra: 0 + 0 = 0, 0 + 1 = 1 + 0 = 1, 1 + 1 = 1) & (logical AND)

′ when illustrating the minterms e.g. x′ =defined NOT x, + for Boolean OR (from Boolean algebra: 0 + 0 = 0, 0 + 1 = 1 + 0 = 1, 1 + 1 = 1) & (logical AND)

Nintendo Volleyball Unbound - Pro Beach Volleyball (2016), Windows; Great Boolean Super Volley Blast (2018), Nintendo Switch, PlayStation 4, Xbox One, Windows

defined, all Boolean logic can be implemented in terms of if-then-else structures. Boolean NOT (which returns the opposite of a given Boolean) works the

Fuzzy rules are used within fuzzy logic systems to infer an output based on input variables. Modus ponens and modus tollens are the most important rules

Fuzzy retrieval techniques are based on the Extended Boolean model and the Fuzzy set theory. There are two classical fuzzy retrieval models: Mixed Min

GNU Octave is a scientific programming language for scientific computing and numerical computation. Octave helps in solving linear and nonlinear problems

MARC standards. Boolean logic The algebraic system, developed by George Boole that is applied to Boolean expressions that contain Boolean operators such

to be fully customizable and extensible using regular expressions and boolean logic. Quod Libet is based on GTK and written in Python, and uses the Mutagen

well as algorithms and computer architecture. His 1986 paper on symbolic Boolean manipulation using Ordered Binary Decision Diagrams (BDDs) has the highest

well as algorithms and computer architecture. His 1986 paper on symbolic Boolean manipulation using Ordered Binary Decision Diagrams (BDDs) has the highest

I_IR_Receiver : boolean @PORTB.4; // TSOP1736 IR receiver O_LED_RECEIVING : boolean @PORTC.0; // Receive in progress O_LED_ERROR : boolean @PORTC.1; // Receive

classification system of U.S. law. Westlaw supports natural language and Boolean searches. Other significant Westlaw features include KeyCite, a citation

normalized fuzzy set of the real line. Just like fuzzy logic is an extension of Boolean logic (which uses absolute truth and falsehood only, and nothing in between)

of the original data structure for which a given predicate returns the Boolean value true. In Haskell, the code example filter even [1..10] evaluates

from the combination of multiple paths (inclusive and exclusive) and the Boolean operations that ultimately determine what the combined path contains. For

in one corner only, so the output of vector-matrix multiplication with Boolean arithmetic is always D, except for C input. Nine further logical matrices

collection representation between Boolean and term frequency-inverse document frequency approaches. When using Boolean weights, any document lies in a vertex

retrieve all information related to a specific query. However, commonly used boolean search methods (exact matches of specified terms) on full text legal documents

double capacity; public boolean accident; public Car() { } public Car(String manufacturer, String model, double capacity, boolean accident) { this.manufacturer

void draw(); public abstract void click (MouseEvent e); public abstract boolean intersects (GameItem other); public abstract void collideWith (GameItem

d-or-fewer columns have the same boolean sum. A matrix is said to be d-disjunct if no set of d columns has a boolean sum which is a superset of any other

further processing, whereas conventional languages would typically use Boolean logic written by the programmer to achieve the same ends. Because the logic

Getter for property "deceased" * Different syntax for a boolean field (is vs get) */ public boolean isDeceased() { return deceased; } /** * Setter for property

research and applied discrete mathematics through the study of pseudo-Boolean functions and their connections to graph theory and data mining. Hammer

using only the symbols 0 and 1. Using the S and K combinators, complex boolean algebra functions can be made. BCL has applications in the theory of program-size

finite-state automata, Boolean circuits and multi-valued logic circuits. Ingo Wegener, in his book The Complexity of Boolean Functions, credits O. B

between the TI-30 series and the TI-35/TI-36 series. Earlier models included Boolean algebra features, though these were removed with the introduction of the

Unit propagation (UP) or boolean constraint propagation (BCP) or the one-literal rule (OLR) is a procedure of automated theorem proving that can simplify

Type errors (such as an attempt to apply the ++ increment operator to a Boolean variable in Java) and undeclared variable errors are sometimes considered

considered to be necessary. In recent years, this has advanced to a study of Boolean relation theory, which attempts to justify large cardinal axioms by demonstrating

to Boolean matrix multiplication, thus inheriting its complexity upper bound of O(n2.3728596). Conversely, Lillian Lee has shown O(n3−ε) Boolean matrix

Java: boolean[][] maze = new boolean[width][height]; // The maze boolean[][] wasHere = new boolean[width][height]; boolean[][] correctPath = new boolean[width][height];

the source of what we know today as Boolean algebra. In fact, however, Boole's algebra differs from modern Boolean algebra: in Boole's algebra A+B cannot

the boolean value false, whereas 1 and many other non-zero values have the boolean value true.) The conditional statement has the form if boolean expression

an exponent (0., 1.5, -0.05, +100.4, -4., .05E-2, -.05E2, 5E02, 5.E2); Boolean (1B for true and 0B for false); Statement Label, and Function Name written

In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF), also called the complete sum of prime implicants, the complete sum

"advanced query" is an explicit Boolean expression. In advanced query mode, `and`, `or`, and `not` are interpreted as Boolean operators rather than as search

Java: boolean[][] maze = new boolean[width][height]; // The maze boolean[][] wasHere = new boolean[width][height]; boolean[][] correctPath = new boolean[width][height];

the source of what we know today as Boolean algebra. In fact, however, Boole's algebra differs from modern Boolean algebra: in Boole's algebra A+B cannot

Logical: Similar to the Boolean datatype a logical has the possible values TRUE and FALSE and in addition UNKNOWN. Boolean: With the Boolean values TRUE and FALSE

was conceived by Frances E. Allen, who noted that Reese T. Prosser used boolean connectivity matrices for flow analysis before. The CFG is essential to

may also differ semantically from functions. For example, short-circuit Boolean operations evaluate later arguments only if earlier ones are not false

Shannon, a dual degree graduate of the University of Michigan, proved that Boolean algebra could be used to simplify the arrangement of the relays that were

2123: attempt to index a boolean value. Lua error in Module:Citation/CS1/Configuration at line 2123: attempt to index a boolean value. Lua error in

projective geometry Duality principle (Boolean algebra), the extension of order-theoretic duality to Boolean algebras S-duality (homotopy theory) List

, A linear-time algorithm for testing the truth of certain quantified boolean formulas, 1979 Dijkstra, E.W., Scholten, C.S., Termination detection for

2123: attempt to index a boolean value. Lua error in Module:Citation/CS1/Configuration at line 2123: attempt to index a boolean value. Lua error in

computer science and education in Russia. Provided scientific results in Boolean functions and Logic Control. Maintained an IEEE and IEEE Industrial Electronics

Prize concerned his work on lower bounds on the size of constant-depth Boolean circuits for the parity function. After Andrew Yao proved that such circuits

computer science and education in Russia. Provided scientific results in Boolean functions and Logic Control. Maintained an IEEE and IEEE Industrial Electronics

templates feature provided by the C++ programming language. Concepts are named Boolean predicates on template parameters, evaluated at compile time. A concept

“Z1” was the first freely programmable computer in the world that used Boolean logic and binary floating-point numbers; however, it was unreliable in

4 yin qu (陰去) ˦˥ (45) high 5 yang qu (陽去) ˩˨ (12) low 6 ru sheng (入聲) ˩˦̚ (14) checked (Boolean value) 7 ru sheng (入聲) ˩̚ (1) checked (Boolean value)'

implicitly public. Thus, a simple interface may be public interface Predator { boolean chasePrey(Prey p); void eatPrey(Prey p); } The member type declarations

Type(s) boolean xs:boolean byte xs:byte byte[] xs:hexBinary double xs:double float xs:float int xs:int long xs:long short xs:short Boolean xs:boolean Byte

condition, also known as a logical disjunction. A spider diagram is a boolean expression involving unitary spider diagrams and the logical symbols ∧

condition is a leaf-level Boolean expression (it cannot be broken down into simpler Boolean expressions). Decision A Boolean expression composed of conditions

the letters of the alphabet, the empty word, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene

ALgol Processor, for a smaller subset of ALGOL 60 (which did not allow boolean variables or operators, blocks, procedures, own or dynamic arrays, conditional