AI & ChatGPT searches , social queries for BOOLEAN ALGEBRA-STRUCTURE
Search references for BOOLEAN ALGEBRA-STRUCTURE. Phrases containing BOOLEAN ALGEBRA-STRUCTURE
See searches and references containing BOOLEAN ALGEBRA-STRUCTURE!
Search references for BOOLEAN ALGEBRA-STRUCTURE. Phrases containing BOOLEAN ALGEBRA-STRUCTURE
See searches and references containing BOOLEAN ALGEBRA-STRUCTURE!BOOLEAN ALGEBRA-STRUCTURE
Algebraic structure modeling logical operations
In mathematics, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties
Boolean_algebra_(structure)
Boolean algebra generated by a set with no relations beyond Boolean laws
free Boolean algebra is a Boolean algebra with a distinguished set of elements, called generators, such that: Each element of the Boolean algebra can be
Free_Boolean_algebra
Algebraic manipulation of "true" and "false"
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the
Boolean_algebra
Topics referred to by the same term
Look up Boolean algebra in Wiktionary, the free dictionary. Boolean algebra is the algebra of truth values and operations on them. Boolean algebra may also
Boolean algebra (disambiguation)
Boolean_algebra_(disambiguation)
a list of topics around Boolean algebra and propositional logic. Algebra of sets Boolean algebra (structure) Boolean algebra Field of sets Logical connective
List of Boolean algebra topics
List_of_Boolean_algebra_topics
Mathematical topics based on the works of George Boole
(usually "true" and "false") Boolean algebra, a logical calculus of truth values or set membership Boolean algebra (structure), a set with operations resembling
Boolean
Algebraic structure used in logic
In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with
Heyting_algebra
Algebraic structure providing a semantics of Łukasiewicz logic
In abstract algebra, a branch of pure mathematics, an MV-algebra is an algebraic structure with a binary operation ⊕ {\displaystyle \oplus } , a unary
MV-algebra
Overview of and topical guide to algebraic structures
algebraic structures are studied. Abstract algebra is primarily the study of specific algebraic structures and their properties. Algebraic structures
Outline of algebraic structures
Outline_of_algebraic_structures
Set with operations obeying given axioms
In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection
Algebraic_structure
Algebraic structure
what Boolean algebras are to set theory and ordinary propositional logic. Interior algebras form a variety of modal algebras. An interior algebra is an
Interior_algebra
Algebraic structure in mathematics
An example is the ring of integers modulo 2. Every Boolean ring gives rise to a Boolean algebra, with ring multiplication corresponding to conjunction
Boolean_ring
Every Boolean algebra is isomorphic to a certain field of sets
In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a certain field of sets. The theorem
Stone's representation theorem for Boolean algebras
Stone's_representation_theorem_for_Boolean_algebras
Topics referred to by the same term
Topological Boolean algebra may refer to: In abstract algebra and mathematical logic, topological Boolean algebra is one of the many names that have been
Topological_Boolean_algebra
Ideals in a Boolean algebra can be extended to prime ideals
In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement
Boolean_prime_ideal_theorem
Mathematical structure combining Boolean algebra with additional residuation operations
residuated Boolean algebra is a residuated lattice whose lattice structure is that of a Boolean algebra. Examples include Boolean algebras with the monoid
Residuated_Boolean_algebra
Reasoning about equations with free variables
and the algebraic structure which are its models are shown on the right in the same row. Some of these structures are either Boolean algebras or proper
Algebraic_logic
countable choice Axiom of dependent choice Zorn's lemma Boolean algebra (structure) Boolean-valued model Burali-Forti paradox Cantor's back-and-forth
List of mathematical logic topics
List_of_mathematical_logic_topics
Boolean algebra with unary operators expressing necessity and possibility modalities
0 , 1 ⟩ {\displaystyle \langle A,\land ,\lor ,-,0,1\rangle } is a Boolean algebra, ◻ {\displaystyle \Box } is a unary operation on A satisfying ◻ 1 =
Modal_algebra
Topics referred to by the same term
algebra, in which a set of finitary relations that is closed under certain operators Boolean algebra and Boolean algebra (structure) Heyting algebra In
Algebra_(disambiguation)
Law in algebra
\scriptstyle \land } a = a). Examples of lattices include Heyting algebras and Boolean algebras, in particular sets of sets with union (∪) and intersection
Absorption_law
algebra Kleene algebra (with involution) Łukasiewicz–Moisil algebra Boolean algebra (structure) Boolean ring Complete Boolean algebra Orthocomplemented
List_of_order_theory_topics
Algebraization of first-order logic with equality
This is comparable to the role Boolean algebras play for propositional logic. Cylindric algebras are Boolean algebras equipped with additional cylindrification
Cylindric_algebra
English mathematician and philosopher (1815–1864)
equations and algebraic logic, and is best known as the author of The Laws of Thought (1854), which contains Boolean algebra. Boolean logic, essential
George_Boole
System including an indeterminate value
tables. Philosophy portal Binary logic (disambiguation) Boolean algebra (structure) Boolean function Digital circuit Four-valued logic Homogeneity (linguistics)
Three-valued_logic
Concept in mathematical logic
science, a Boolean domain is usually written as {0, 1}, or B . {\displaystyle \mathbb {B} .} The algebraic structure that naturally builds on a Boolean domain
Boolean_domain
polyadic algebra and first-order logic is analogous to the relationship between Boolean algebras and propositional logic (see Lindenbaum–Tarski algebra). There
Polyadic_algebra
Algebraic concept in measure theory, also referred to as an algebra of sets
play an essential role in the representation theory of Boolean algebras. Every Boolean algebra can be represented as a field of sets. A field of sets
Field_of_sets
Set theory concept
"true" and "false", but instead take values in some fixed complete Boolean algebra. Boolean-valued models were introduced by Dana Scott, Robert M. Solovay
Boolean-valued_model
Type of residuated Boolean algebra with extra structure
In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation
Relation_algebra
Logical connective AND
And-inverter graph AND gate Bitwise AND Boolean algebra Boolean conjunctive query Boolean domain Boolean function Boolean-valued function Conjunction/disjunction
Logical_conjunction
Overview of and topical guide to logic
Zeroth-order logic Boolean algebra (list) Boolean logic Boolean algebra (structure) Boolean algebras canonically defined Introduction to Boolean algebra Complete
Outline_of_logic
Boolean algebra with a derivative operator capturing change or boundary behavior
abstract algebra, a derivative algebra is an algebraic structure of the signature <A, ·, +, ', 0, 1, D> where <A, ·, +, ', 0, 1> is a Boolean algebra and D
Derivative algebra (abstract algebra)
Derivative_algebra_(abstract_algebra)
Birman–Wenzl algebra Boolean algebra Borcherds algebra Brauer algebra C*-algebra Central simple algebra Clifford algebra Cluster algebra Dendriform algebra Differential
List_of_algebras
Technical treatment of Boolean algebras
Boolean algebra is a mathematically rich branch of abstract algebra. Stanford Encyclopaedia of Philosophy defines Boolean algebra as 'the algebra of two-valued
Boolean algebras canonically defined
Boolean_algebras_canonically_defined
these solutions. Pre-algebra Elementary algebra Boolean algebra Abstract algebra Linear algebra Universal algebra An algebraic equation is an equation
Outline_of_algebra
1969 non-fiction book by G. Spencer-Brown
Boolean arithmetic; The primary algebra (Chapter 6 of LoF), whose models include the two-element Boolean algebra (hereinafter abbreviated 2), Boolean
Laws_of_Form
System of logic lacking the excluded middle law
Morgan laws, either law implies the other, and an algebra which satisfies them becomes a Boolean algebra. Remark: It follows that ¬(x ∨ y) = ¬x ∧ ¬y, ¬1
De_Morgan_algebra
Boolean algebra extended with a unary operator representing existential quantification
In abstract algebra, a monadic Boolean algebra is an algebraic structure A with signature ⟨·, +, ', 0, 1, ∃⟩ of type ⟨2,2,1,0,0,1⟩, where ⟨A, ·, +, ',
Monadic_Boolean_algebra
Model of computation
inter-operable with deterministic Boolean logic circuits. However, an algebraic structure equivalent of Boolean algebra and associated methods of circuit
Boolean_circuit
Function that outputs either true or false
required to determine a final truth value. Bit Boolean data type Boolean algebra (logic) Boolean domain Boolean logic Propositional calculus Truth table Logic
Boolean-valued_function
Boolean function
Derandomize the Valiant proof of a monotone formula. Boolean algebra (structure) Boolean algebras canonically defined Boyer–Moore majority vote algorithm
Majority_function
In mathematics, BCI and BCK algebras are algebraic structures in universal algebra, which were introduced by Y. Imai, K. Iséki and S. Tanaka in 1966, that
BCK_algebra
algebras are Boolean algebras. This was proved by William McCune in 1997, so the term "Robbins algebra" is now simply a synonym for "Boolean algebra"
Robbins_algebra
Algebraic structure of set algebra
measure on X , {\displaystyle X,} the measure algebra of ( X , μ ) {\displaystyle (X,\mu )} is the Boolean algebra of all Borel sets modulo μ {\displaystyle
Σ-algebra
Commutative algebra studies commutative rings, their ideals, and modules over such rings
remainder theorem Field (mathematics) Algebraic number field Polynomial ring Integral domain Boolean algebra (structure) Principal ideal domain Euclidean
List of commutative algebra topics
List_of_commutative_algebra_topics
Mathematical model of quantum mechanics
Effect algebras are partial algebras which abstract the (partial) algebraic properties of events that can be observed in quantum mechanics. Structures equivalent
Effect_algebra
term Cantor algebra is also occasionally used to mean the Boolean algebra of all clopen subsets of the Cantor set, or the Boolean algebra of Borel subsets
Jónsson–Tarski_algebra
Concept in mathematical logic
is a Boolean algebra, provided the logic is classical. If the theory T consists of the propositional tautologies, the Lindenbaum–Tarski algebra is the
Lindenbaum–Tarski_algebra
Vector space equipped with a bilinear product
algebra over a field (often simply called an algebra) is a vector space equipped with a bilinear product. Thus, an algebra is an algebraic structure consisting
Algebra_over_a_field
Branch of mathematics
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations
Abstract_algebra
Identities and relationships involving sets
Any set of sets closed under the set-theoretic operations forms a Boolean algebra with the join operator being union, the meet operator being intersection
Algebra_of_sets
Algebraic structure with addition and multiplication
In mathematics, a ring is an algebraic structure consisting of a set with two binary operations typically called addition and multiplication and denoted
Ring_(mathematics)
Graphical method to simplify Boolean expressions
Karnaugh map (KM or K-map) is a diagram that can be used to simplify a Boolean algebra expression. Maurice Karnaugh introduced the technique in 1953 as a
Karnaugh_map
Mathematical structure in abstract algebra
more specifically in abstract algebra, a *-algebra (or involutive algebra; read as "star-algebra") is a mathematical structure consisting of two involutive
*-algebra
Ring that is also a vector space or a module
a ring homomorphism from K into the center of A. This is thus an algebraic structure with an addition, a multiplication, and a scalar multiplication (the
Associative_algebra
Symbolic boolean function representation, extension of BDDs
An algebraic decision diagram (ADD) or a multi-terminal binary decision diagram (MTBDD), is a data structure that is used to symbolically represent a
Algebraic_decision_diagram
Algebraic ring that need not have additive negative elements
lattices. The smallest semiring that is not a ring is the two-element Boolean algebra, for instance with logical disjunction ∨ {\displaystyle \lor } as addition
Semiring
Concept in mathematical logic
isomorphism between the algebra of sets and the Boolean algebra, that is, they have the same structure. Then, if we map Boolean operators into set operators
Functional_completeness
Branch of mathematics
Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems
Algebra
Mathematical set of all subsets of a set
the Boolean algebra of the power set of a finite set. For infinite Boolean algebras, this is no longer true, but every infinite Boolean algebra can be
Power_set
2-valued morphism is a homomorphism that sends a Boolean algebra B onto the two-element Boolean algebra 2 = {0,1}. It is essentially the same thing as an
2-valued_morphism
Theory of algebraic structures in general
algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures in general, not specific types of algebraic structures
Universal_algebra
Value indicating the relation of a proposition to truth
done in algebraic semantics. The algebraic semantics of intuitionistic logic is given in terms of Heyting algebras, compared to Boolean algebra semantics
Truth_value
complete Boolean algebras. The projections of a commutative AW*-algebra form a complete Boolean algebra, and conversely, any complete Boolean algebra is isomorphic
AW*-algebra
Algebraic structure with addition, multiplication, and division
rational numbers do. A field is thus a fundamental algebraic structure that is widely used in algebra, number theory, and many other areas of mathematics
Field_(mathematics)
Idempotent semiring endowed with a closure operator
obtain a Kleene algebra. Every Boolean algebra with operations ∨ {\displaystyle \lor } and ∧ {\displaystyle \land } turns into a Kleene algebra if we use ∨
Kleene_algebra
Additional mathematical object
partial list of possible structures is measures, algebraic structures (groups, fields, etc.), topologies, metric structures (geometries), orders, graphs
Mathematical_structure
Function that returns cardinal numbers
of Boolean algebras. We can mention, for example, the following functions: Cellularity c ( B ) {\displaystyle c(\mathbb {B} )} of a Boolean algebra B {\displaystyle
Cardinal_function
Subset with finite complement
forms a Boolean algebra, which means that it is closed under the operations of union, intersection, and complementation. This Boolean algebra is the finite–cofinite
Cofiniteness
Class of algebraic structures
In universal algebra, a variety of algebras or equational class is the class of all algebraic structures of a given signature satisfying a given set of
Variety_(universal_algebra)
Special type of lattice
distributes over "or" and vice versa. Every Boolean algebra is a distributive lattice. Every Heyting algebra is a distributive lattice. Especially this
Distributive_lattice
In mathematics, an algebraic structure
general concept, include Boolean algebras, Heyting algebras, residuated Boolean algebras, relation algebras, and MV-algebras. Residuated semilattices
Residuated_lattice
In mathematics, element that equals its square
of modules, and connected to homological properties of the ring. In Boolean algebra, the main objects of study are rings in which all elements are idempotent
Idempotent_(ring_theory)
Set whose pairs have minima and maxima
universal algebra. The class of lattices can be generalized to semilattices, and some notable subclasses of lattices are Heyting algebras, Boolean algebras, distributive
Lattice_(order)
Mapping of mathematical formulas to a particular meaning
Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields and vector spaces. The term universal algebra is
Structure (mathematical logic)
Structure_(mathematical_logic)
Data structure for Boolean functions
decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered
Binary_decision_diagram
solves types of the Boolean satisfiability problem despite there being no known efficient algorithm in the general case. The Boolean satisfiability (or
Boolean satisfiability algorithm heuristics
Boolean_satisfiability_algorithm_heuristics
Branch of mathematics
additional order structures that are often specified via algebraic operations and defining identities are Heyting algebras and Boolean algebras, which both
Order_theory
Property involving two mathematical operations
of structures with two operations that are each distributive over the other are Boolean algebras such as the algebra of sets or the switching algebra. Multiplying
Distributive_property
Binary tree representing a mathematical expression
of expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and
Binary_expression_tree
Symbol connecting formulas in logic
portal Boolean domain Boolean function Boolean logic Boolean-valued function Catuṣkoṭi Dialetheism Four-valued logic List of Boolean algebra topics Logical
Logical_connective
Maximal proper filter
{\displaystyle {\mathcal {P}}(X),} ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on P ( X ) {\displaystyle {\mathcal
Ultrafilter
{\displaystyle {\bf {3}}} , or Boolean type, iff M {\displaystyle \mathbb {M} } is polynomially equivalent to a two-element Boolean algebra. M {\displaystyle \mathbb
Minimal_algebra
In abstract algebra, a skew lattice is an algebraic structure that is a non-commutative generalization of a lattice. While the term skew lattice can be
Skew_lattice
Greek physicist (born 1971)
subobject classifier (which has a Heyting algebra structure, but not necessarily a Boolean algebra structure). For example, hard-to-picture category-theoretic
Fotini_Markopoulou-Kalamara
Theories in mathematical logic
first-order properties of Boolean algebras: Atomic: ∀x x = 0 ∨ ∃y y ≤ x ∧ atom(y) Atomless: ∀x ¬atom(x) The theory of atomless Boolean algebras is ω-categorical
List_of_first-order_theories
Attribute of data
floating-point numbers (which approximate real numbers), characters and Booleans. A data type may be specified for many reasons: similarity, convenience
Data_type
Branch of logic
Higher-order logic Boolean algebra (logic) Boolean algebra (structure) Boolean algebra topics Boolean domain Boolean function Boolean-valued function Categorical
Propositional_logic
Algebraic structure
complete Boolean algebras, and the map f − 1 : P ( Y ) → P ( X ) {\displaystyle f^{-1}:P(Y)\to P(X)} is a homomorphism of complete Boolean algebras. Suppose
Complete_Heyting_algebra
Bound lattice in which every element has a complement
distributive lattice has a unique orthocomplementation and is in fact a Boolean algebra. A complemented lattice is a bounded lattice (with least element 0
Complemented_lattice
Lattice in universal algebra
vectors: a = (a1, ..., an). The set 2n carries a natural product Boolean algebra structure. That is, ordering, meets, joins, and other operations on n-ary
Post's_lattice
Encoded data represented in binary notation
Mathematical 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,
Binary_code
Data whose unit can take on only two possible states
labelled as 0 and 1 in accordance with the binary numeral system and Boolean algebra. Binary data occurs in many different technical and scientific fields
Binary_data
Proof that every structure with certain properties is isomorphic to another structure
vector spaces. Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. A variant, Stone's
Representation_theorem
Process in digital electronics and integrated circuit design
nano-scale level of metallic structures on an integrated circuit. In terms of Boolean algebra, the optimization of a complex Boolean expression is a process
Logic_optimization
Function in Boolean algebra
In Boolean algebra, a parity function is a Boolean function whose value is one if and only if the input vector has an odd number of ones. The parity function
Parity_function
Basic concepts of algebra
{b^{2}-4ac}}}{2a}}}}}} Elementary algebra, also known as high school algebra or college algebra, encompasses the basic concepts of algebra. It is often contrasted
Elementary_algebra
Logic gate
kinds. As alternative, if different gates are available we can apply Boolean algebra to transform ( A ⋅ B ¯ ) + ( A ¯ ⋅ B ) ≡ ( A + B ) ⋅ ( A ¯ + B ¯ )
XOR_gate
Method in mathematical logic
Fraïssé limit of the class of nontrivial finite Boolean algebras is the unique countable atomless Boolean algebra. The class K {\displaystyle \mathbf {K} }
Fraïssé_limit
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
Surname or Lastname
English
English : variant of Bowerman.
Girl/Female
Muslim
A star in the constellation Leo
Girl/Female
Indian
Speaker of truth
Surname or Lastname
Irish
Irish : Anglicized form of Gaelic Ó Baoighealláin. It was the name of a sept of Dartry, County Monaghan.English : variant of Boyland.
Girl/Female
Arabic, Muslim
Truthful
Girl/Female
Indian
Flowering, Blooming, Flower
Girl/Female
Muslim/Islamic
A star in the constellation Leo
Surname or Lastname
English
English : topographic name for someone who lived on a curved or irregularly shaped piece of land, from Old English wÅh ‘curved’, ‘crooked’ + land ‘land’, ‘estate’, or a habitational name from Woolland in Dorset, named from an Old English winn, wynn ‘meadow’, ‘pasture’ + land ‘land’, ‘estate’.
Female
Italian
Italian name ALLEGRA means "cheerful and lively."
Boy/Male
American, British, English
Lives at the Buck Meadow
Girl/Female
Arabic
Aristocratic Lady
Surname or Lastname
English
English : variant of Wool.Americanized form of Jewish Wollman or German Wollmann (see Wollman).
Surname or Lastname
English
English : variant of Bullen.
Girl/Female
Italian
Lively. Happy.
Girl/Female
Italian
Meaning cheerful or lively, related to the musical term allegro. Allegra was the name given by...
Girl/Female
Arabic, French
A Star in the Constellation Leo
Male
English
Variant spelling of Middle English Algar, ALGER means elf spear."Â
Surname or Lastname
English
English : from one or more Middle English personal names variously written Alger, Algar, Alcher, Aucher, etc. These represent a falling together of at least three different Continental Germanic and Old English names: Adalgar ‘noble spear’ (Old English Æ{dh}elgÄr), Albgar ‘elf spear’ (Old English ÆlfgÄr), and Aldgar ‘old spear’ (Old English (E)aldgÄr). The Continental Germanic forms were brought to England from France by the Normans. Compare the French cognate Auger. In Norfolk and northern England, the source is probably the Old Norse name Ãlfgeirr ‘elf spear’. The modern English surname is found mainly in East Anglia.German : from a reduced form of the Germanic personal name Adalgar (see 1 above).Abiezer Alger was a merchant in Easton, MA, in the 18th century, who had many prominent descendants.
Boy/Male
Irish
Puppy.
Surname or Lastname
English
English : variant of Boland.Irish : Anglicized form of Gaelic Ó Beólláin, ‘descendant of Bjolan’, a Norse personal name.
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
Girl/Female
Muslim/Islamic
Beloved
Boy/Male
Tamil
Janakiraman | ஜாநகீரமந
God name, Husband of Janki
Boy/Male
Indian, Punjabi, Sikh
New Generation
Boy/Male
Indian, Punjabi, Sikh
Brave in the Battlefield
Male
Norse
Variant spelling of Old Norse Yngvarr, INGVARR means "Ing's warrior."
Male
English
English surname transferred to forename use, FREEMAN means "freeman."
Female
Hebrew
(גַּל) Hebrew unisex name GAL means "mound, wave."
Boy/Male
Muslim
Protractor, One who worships God
Girl/Female
Bengali, Indian, Telugu
They are Responsible; Loving; Idealistic
Boy/Male
Hindu
Free
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
BOOLEAN ALGEBRA-STRUCTURE
a.
Having the characteristic of Zoilus, a bitter, envious, unjust critic, who lived about 270 years before Christ.
a.
Of or pertaining to wool or woolen cloths; as, woolen manufactures; a woolen mill; a woolen draper.
pl.
of Woolman
a.
A branch of algebra which relates to the direct search for unknown quantities.
n.
A native of Algeria.
n.
That branch of algebra which treats of quadratic equations.
n.
That branch of mathematics which treats of the relations and properties of quantity by means of letters and other symbols. It is applicable to those relations that are true of every kind of magnitude.
n.
One who deals in wool.
pl.
of Bookman
a.
Of or relating to algebra; as, cossic numbers, or the cossic art.
a.
Made of wool; consisting of wool; as, woolen goods.
pl.
of Palpebra
a.
Of or pertaining to Algeria.
adv.
By algebraic process.
a.
Originated or taught by Diophantus, the Greek writer on algebra.
v. t.
To perform by algebra; to reduce to algebraic form.
n.
A treatise on this science.
a.
Of or pertaining to algebra; containing an operation of algebra, or deduced from such operation; as, algebraic characters; algebraical writings.
n.
One versed in algebra.
n.
A studious man; a scholar.