AI & ChatGPT searches , social queries for RAMSEYS THEOREM
Search references for RAMSEYS THEOREM. Phrases containing RAMSEYS THEOREM
See searches and references containing RAMSEYS THEOREM!
Search references for RAMSEYS THEOREM. Phrases containing RAMSEYS THEOREM
See searches and references containing RAMSEYS THEOREM!RAMSEYS THEOREM
Statement in mathematical combinatorics
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours)
Ramsey's_theorem
Branch of mathematical combinatorics
red triangle? It turns out that the answer is 6. See the article on Ramsey's theorem for a rigorous proof. Another way to express this result is as follows:
Ramsey_theory
Mathematical theorem
The theorem on friends and strangers is a mathematical theorem in an area of mathematics called Ramsey theory. Suppose a party has six people. Consider
Theorem on friends and strangers
Theorem_on_friends_and_strangers
Sufficiently long sequences of numbers have long monotonic subsequences
finitary result that makes precise one of the corollaries of Ramsey's theorem. While Ramsey's theorem makes it easy to prove that every infinite sequence of
Erdős–Szekeres_theorem
British philosopher, mathematician and economist (1903–1930)
a Problem of Formal Logic now bears his name (Ramsey's theorem). While this theorem is the work Ramsey is probably best remembered for, he proved it only
Frank_P._Ramsey
Theorem in mathematical logic
logic, the Paris–Harrington theorem states that a certain claim in Ramsey theory, namely the strengthened finite Ramsey theorem, which is expressible in
Paris–Harrington_theorem
In combinatorics
In mathematics, the Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after
Graham–Rothschild_theorem
Limitative results in mathematical logic
Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Collection of sets in which every two sets have the same intersection
vertices represent the sets and edges are colored by intersection size, Ramsey's theorem guarantees the existence of a large monochromatic clique, which corresponds
Sunflower_(mathematics)
Theorem in combinatorial set theory extending Ramsey's theorem to uncountable sets
theory, a branch of mathematics, the Erdős–Rado theorem is a basic result extending Ramsey's theorem to uncountable sets. It is named after Paul Erdős
Erdős–Rado_theorem
a second color for E2 to obtain a triangle-free edge coloring. By Ramsey's theorem, for any finite number k of colors, there exists a number n such that
Monochromatic_triangle
Provability logic
In mathematical logic, Löb's theorem states that in Peano arithmetic (PA) (or any formal system including PA), for any formula P, if it is provable in
Löb's_theorem
Mathematical result on systems of linear equations
Rado's theorem is a theorem from the branch of mathematics known as Ramsey theory. It is named for the German mathematician Richard Rado. It was proved
Rado's theorem (Ramsey theory)
Rado's_theorem_(Ramsey_theory)
that these Ramsey-type theorems can be expressed as the assertion that a certain category (or class of finite structures) has the Ramsey property (defined
Structural_Ramsey_theory
Extension of ideas in combinatorics to infinite sets
things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the
Infinitary_combinatorics
theorem (combinatorics) Halpern–Läuchli theorem (Ramsey theory) Hindman's theorem (Ramsey theory) Kirchhoff's theorem (graph theory) Kneser's theorem
List_of_theorems
Gowers' theorem, also known as Gowers' Ramsey theorem and Gowers' FINk theorem, is a theorem in Ramsey theory and combinatorics. It is a Ramsey-theoretic
Gowers'_theorem
Theorem in combinatorics generalizing Ramsey's theorem to infinite trees
In mathematics, Milliken's tree theorem in combinatorics is a partition theorem generalizing Ramsey's theorem to infinite trees, objects with more structure
Milliken's_tree_theorem
Topics referred to by the same term
mathematics Ramsey's theorem, in combinatorics Ramsey, an Amiga custom chip HMS Ramsey, the name of several Royal Navy ships SS The Ramsey, a passenger steamship
Ramsey
Ramsey-Turán theory is a subfield of extremal graph theory. It studies common generalizations of Ramsey's theorem and Turán's theorem. In brief, Ramsey-Turán
Ramsey-Turán_theory
Branch of mathematical logic
are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast
Reverse_mathematics
Mathematical concept
a Ramsey cardinal is a certain kind of large cardinal number introduced by Erdős & Hajnal (1962) and named after Frank P. Ramsey, whose theorem, called
Ramsey_cardinal
Generalization of both Ramsey's theorem and Hindman's theorem
mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith Milliken
Milliken–Taylor_theorem
Positional game
to Simmons. They called it the Ramsey game, since it is closely related to Ramsey's theorem (see below). Ramsey's theorem implies that, whenever we color
Clique_game
American mathematician
mathematics in 1967. His doctoral dissertation, titled A Generalization of Ramsey's Theorem and a Conjecture of Rota, was supervised by Øystein Ore. Following
Bruce_Lee_Rothschild
Expression denoting a set of sets in formal semantics
Then the infinite Ramsey theorem states that ⋁ i = 1 m Q 2 ( C i ) {\displaystyle \bigvee _{i=1}^{m}Q^{2}(C_{i})} . Of type ⟨n⟩: Ramsey quantifier Q n {\displaystyle
Generalized_quantifier
Type of topological space
{\displaystyle \mathrm {dis} (X)\geq \Delta (X)} . There is an analogue of Ramsey's theorem from combinatorics for polyadic spaces. For this, we describe the relationship
Polyadic_space
Yes-or-no question that cannot ever be solved by a computer
Harrington proved that the Paris-Harrington principle, a version of the Ramsey theorem, is undecidable in the axiomatization of arithmetic given by the Peano
Undecidable_problem
mathematical theory of infinite graphs, the Erdős–Dushnik–Miller theorem is a form of Ramsey's theorem stating that every infinite graph contains either a countably
Erdős–Dushnik–Miller_theorem
Large number coined by Ronald Graham
Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was
Graham's_number
Natural number
different colors, there is bound to be a monochromatic triangle; see Ramsey's theorem. Either 16 or 18 unit squares can be formed into rectangles with perimeter
17_(number)
British mathematician (1906–1989)
Erdős–Rado theorem extends Ramsey's theorem to infinite sets. It was published by Erdős and Rado in 1956. Rado's theorem is another Ramsey-theoretic result
Richard_Rado
Conjecture in graph theory
Ramsey's theorem proves that no graph has both its maximum clique size and maximum independent set size smaller than logarithmic. Ramsey's theorem also
Erdős–Hajnal_conjecture
Mathematical rule for inverting probabilities
Bayes' theorem (alternatively Bayes' law or Bayes' rule), named after Thomas Bayes (/beɪz/), gives a mathematical rule for inverting conditional probabilities
Bayes'_theorem
Class satisfying a generalization of Ramsey's theorem
area of mathematics known as Ramsey theory, a Ramsey class is one which satisfies a generalization of Ramsey's theorem. Suppose A {\displaystyle A}
Ramsey_class
Long dense subsets of the integers contain arbitrarily large arithmetic progressions
In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured
Szemerédi's_theorem
Set of natural numbers
semigroups in general. A variant of Hindman's theorem is true for arbitrary semigroups. Ergodic Ramsey theory Piecewise syndetic set Syndetic set Thick
IP_set
One of several theorems in different areas of mathematics
mathematics, Schur's theorem is any of several theorems of the mathematician Issai Schur. In differential geometry, Schur's theorem is a theorem of Axel Schur
Schur's_theorem
Branch of discrete mathematics
things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the
Combinatorics
theorem Goodstein's theorem Green's theorem (to do) Green's theorem when D is a simple region Heine–Borel theorem Intermediate value theorem Itô's lemma Kőnig's
List_of_mathematical_proofs
linearly ordered set X as a set of indiscernibles. The proof uses Ramsey's theorem. The Ehrenfeucht–Mostowski is used to construct models with many automorphisms
Ehrenfeucht–Mostowski_theorem
Fundamental combinatorial result of Ramsey theory
In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory, named after Alfred W. Hales and Robert I. Jewett, that
Hales–Jewett_theorem
Branch of mathematical logic
proof-theoretic semantics, reverse mathematics, proof mining, automated theorem proving, and proof complexity. Much research also focuses on applications
Proof_theory
If there are more items than boxes holding them, one box must contain at least two items
theorem Hilbert's paradox of the Grand Hotel Multinomial theorem Pochhammer symbol Ramsey's theorem Herstein 1964, p. 90 Rittaud, Benoît; Heeffer, Albrecht
Pigeonhole_principle
Branch of mathematics that studies sets
cardinal arithmetic and the study of extensions of Ramsey's theorem such as the Erdős–Rado theorem. Set theory and category theory are distinct but closely
Set_theory
Theorem in Ramsey theory
Van der Waerden's theorem is a theorem in Ramsey theory. Van der Waerden's theorem states that for any given positive integers r and k, there is some number
Van_der_Waerden's_theorem
Automaton which either accepts or rejects infinite inputs
L_{f}(L_{g})^{\omega }} . Proof: We will use the infinite Ramsey theorem to prove this theorem. Let w = a 0 a 1 … {\textstyle w=a_{0}a_{1}\ldots } and w
Büchi_automaton
Adjacent subset of an undirected graph
{\frac {n}{2}}\right\rceil } edges must contain a three-vertex clique. Ramsey's theorem states that every graph or its complement graph contains a clique with
Clique_(graph_theory)
University Professor of Mathematical Science in Singapore
Tat Chong, Theodore A Slaman and Yue Yang, The inductive strength of Ramsey's Theorem for Pairs, Advances in Mathematics 308 (2017), 121–141. Chi Tat Chong
Chong_Chi_Tat
Topics referred to by the same term
Rado's theorem or Radó's theorem may refer to: Tibor Radó's theorem (harmonic functions) Tibor Radó's theorem (Riemann surfaces) Richard Rado's theorem (Ramsey
Rado's_theorem
Ordinal-indexed family of rapidly increasing functions
; Thumser, W.; Voigt, B. (1991). "Fast growing functions based on Ramsey theorems". Discrete Mathematics. 95 (1–3): 341–358. doi:10.1016/0012-365X(91)90346-4
Fast-growing_hierarchy
On the existence of arithmetic progressions in subsets of the natural numbers
Roth's theorem on arithmetic progressions is a result in additive combinatorics concerning the existence of arithmetic progressions in subsets of the
Roth's theorem on arithmetic progressions
Roth's_theorem_on_arithmetic_progressions
Theorem in arithmetic combinatorics on finite partitions of the natural numbers
Folkman's theorem is a theorem in mathematics, and more particularly in arithmetic combinatorics and Ramsey theory. According to this theorem, whenever
Folkman's_theorem
English logician and former investment banker
post-doctoral adviser Theodore Slaman applying reverse mathematics to Ramsey's theorem. He also proposed the so-called "Seetapun Enigma", a mathematical puzzle
David_Seetapun
American mathematician (1935–2020)
the Graham–Rothschild theorem in the Ramsey theory of parameter words and Graham's number derived from it, the Graham–Pollak theorem and Graham's pebbling
Ronald_Graham
Incidence coloring List coloring List edge-coloring Perfect graph Ramsey's theorem Sperner's lemma Strong coloring Subcoloring Tait's conjecture Total
List_of_graph_theory_topics
2014 book by Denis Hirschfeldt
and the low basis theorem. Chapter six, "the real heart of the book", applies this method to an infinitary form of Ramsey's theorem: every edge coloring
Slicing_the_Truth
smaller. It follows from Ramsey's theorem that for any graph G there exists a least integer r ( G ) {\displaystyle r(G)} , the Ramsey number of G, such that
Burr–Erdős_conjecture
Chinese researcher
Hunan. When he was a 22-year-old undergraduate student, Lu proved that Ramsey theorem for infinite graphs (the case n = 2) with 2-coloring does not imply
Liu_Lu
Israeli mathematician
several areas of mathematics: - Stochastic Ramsey theorem: A stochastic generalization of Ramsey's theorem on infinite graphs, applicable to stopping
Eilon_Solan
also χ {\displaystyle \chi } -bounded, as Ramsey's theorem implies that they have large cliques. Vizing's theorem can be interpreted as stating that the
Chi-bounded
Assignment of colors to edges of a graph
a given graph is called the chromatic index of the graph. By Vizing's theorem, the number of colors needed to edge color a simple graph is either its
Edge_coloring
Exponent of a power of two
equality when the partial cube is a hypercube graph. According to Ramsey's theorem, every n-vertex undirected graph has either a clique or an independent
Binary_logarithm
Mexican mathematician
(2003) Juan José Montellano-Ballesteros, Víctor Neumann-Lara "An Anti-Ramsey Theorem" Combinatorica 22(3): 445–449 (2002) Francisco Larrión, Víctor Neumann-Lara
Víctor_Neumann-Lara
Canadian mathematician (born 1955)
such as the Hales-Jewett Theorem, Ramsey Theorem, the chromatic number of the plane problem, and van der Waerden's Theorem. Jungić's research also encompasses
Veselin_Jungić
Smallest number of edges of an equivalent polygonal path for a knot
doi:10.1142/S0218216597000170, MR 1452441 Negami, Seiya (1991), "Ramsey theorems for knots, links and spatial graphs", Transactions of the American
Stick_number
Canadian statistician and academic administrator
University of Waterloo; his thesis was entitled "Chromatic Graphs and Ramsey's Theorem" and was supervised by Ralph Gordon Stanton. He joined the faculty
James_G._Kalbfleisch
Mathematical problem
Davenport constant Subset sum problem Zero-sum Ramsey theory Erdős, Paul; Ginzburg, A.; Ziv, A. (1961). "Theorem in the additive number theory". Bull. Res
Zero-sum_problem
Software system
Nqthm is a theorem prover sometimes referred to as the Boyer–Moore theorem prover. It was a precursor to ACL2. The system was developed by Robert S. Boyer
Nqthm
American mathematician (born 1971)
on Ramsey theory". Throughout the book, Robertson discusses several theorems including Ramsey's Theorem, Van der Waerden's Theorem, Rado's Theorem, and
Aaron Robertson (mathematician)
Aaron_Robertson_(mathematician)
Theorem about prime numbers
In number theory, the Green–Tao theorem, proven by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long
Green–Tao_theorem
In mathematics, Dvoretzky's theorem is an important structural theorem about normed vector spaces proved by Aryeh Dvoretzky in the early 1960s, answering
Dvoretzky's_theorem
Mathematical subject
which became Szemerédi's theorem, generalizes the statement of van der Waerden's theorem. Hillel Furstenberg proved the theorem using ergodic principles
Ergodic_Ramsey_theory
Generalization of graph theory
of replacement rules; Ramsey's theorem; Erdős–Ko–Rado theorem; Kruskal–Katona theorem on uniform hypergraphs; Hall-type theorems for hypergraphs. In directed
Hypergraph
the analyzing the proof-theoretic strength of Ramsey's theorem. High (computability) Low basis theorem R. Downey, R. A. Shore, Degree Theoretic Definitions
Low_(computability)
(They are also called partition cardinals.) 3. The Erdős–Rado theorem extends Ramsey's theorem to infinite cardinals ethereal cardinal An ethereal cardinal
Glossary_of_set_theory
Partition result about finite products of infinite trees
In mathematics, the Halpern–Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for
Halpern–Läuchli_theorem
(1908). H. J. Prömel, W. Thumser, B. Voigt, "Fast growing functions and Ramsey theorems" (1991), Discrete Mathematics vol. 95, pp. 341–358. A. Weiermann, Classifying
Fundamental sequence (set theory)
Fundamental_sequence_(set_theory)
process Independent set Graph coloring Covering number Set packing Ramsey's theorem Set cover problem Sphere packing Steiner system Matching in hypergraphs
Packing_in_a_hypergraph
{\displaystyle \forall i\in I\setminus X,\forall x\in X,x<i} . This generalizes Ramsey's theorem, as each [ A ] n {\displaystyle [A]^{n}} is a barrier. (Nash-Williams
Partition_regularity
Theorem of dominion in abstract algebra
Isbell's zigzag theorem, a theorem of abstract algebra characterizing the notion of a dominion, was introduced by American mathematician John R. Isbell
Isbell's_zigzag_theorem
Graph without four-vertex star subgraphs
chromatic number contains a large clique. More strongly, it follows from Ramsey's theorem that every claw-free graph of large maximum degree contains a large
Claw-free_graph
Israeli-American mathematician and physics professor
relationship of EGZ theorem to Ramsey Theory on graphs. Bialostocki, Erdős, and Lefmann introduced the relationship of EGZ theorem to Ramsey Theory on the positive
Arie_Bialostocki
Czech mathematician (1933–2018)
1007/BF01113568. S2CID 120230682. Chvatal, V.; Erdös, P.; Hedrlín, Z. (1972). "Ramsey's theorem and self-complementary graphs". Discrete Mathematics. 3 (4): 301–304
Zdeněk_Hedrlín
Maximal proper filter
non-principal ultrafilters. The name Ramsey comes from Ramsey's theorem. To see why, one can prove that an ultrafilter is Ramsey if and only if for every 2-coloring
Ultrafilter_on_a_set
Axiomatic set theories based on the principles of mathematical constructivism
reformulations of classical theorems. For example, in constructive analysis, one cannot prove the intermediate value theorem in its textbook formulation
Constructive_set_theory
the Paris–Harrington theorem. They showed that a certain finitistic theorem in Ramsey theory is not provable in Peano arithmetic (PA). Given a set s ⊆ N
Kanamori–McAloon_theorem
American mathematician
Carlson, Timothy J.; Simpson, Stephen G. (1984), "A dual form of Ramsey's theorem", Advances in Mathematics, 53 (3): 265–290, doi:10.1016/0001-8708(84)90026-4
Steve_Simpson_(mathematician)
American-Canadian mathematician
color class is piece-wise syndetic. In A Density Version of a Geometric Ramsey Theorem, he and Joe P. Buhler showed that “for every ε > 0 {\displaystyle \varepsilon
Tom_Brown_(mathematician)
American mathematician
Larson's research is in infinitary combinatorics, studying versions of Ramsey's theorem for infinite sets. Her doctoral dissertation, On Some Arrow Relations
Jean_A._Larson
Test for the acceptability of conditionals via hypothetical belief revision
test and explored further triviality theorems, including results for negative conditionals ("the negative Ramsey test"). A large literature investigates
Ramsey_test
Book on discrete geometry
geometric, including: Hall's marriage theorem characterizing the bipartite graphs that have a perfect matching. Ramsey's theorem that, if the k {\displaystyle
Combinatorial Geometry in the Plane
Combinatorial_Geometry_in_the_Plane
American mathematician
chosen as a memorial to Folkman by his friends. In Ramsey theory, the Rado–Folkman–Sanders theorem describes "partition regular" sets. For r > max{p,
Jon_Folkman
Mathematical technique used in proof theory
(1984). B. Afshari, M. Rathjen, "Ordinal Analysis and the Infinite Ramsey Theorem". In Lecture Notes in Computer Science vol. 7318 (2012) Marcone, Alberto;
Ordinal_analysis
Study of structures where a subset must sum to zero
of this result using the Cauchy-Davenport theorem, Fermat's little theorem, or the Chevalley–Warning theorem. Generalizing this result, one can define
Zero-sum_Ramsey_theory
Hungarian mathematician (born 1943)
Award (1993) Széchenyi-Prize (2014) A limit theorem in graph theory (with Erdős Pál, 1966) Anti-Ramsey theorems (coauthor, 1973) On the Structure of Edge
Miklós_Simonovits
American mathematician
EBSCOhost 21907347. Burr, S. A.; Erdős, P.; Spencer, J. H. (August 1975). "Ramsey theorems for multiple copies of graphs". Transactions of the American Mathematical
Stefan_Burr
Czech mathematician (born 1946)
mathematician. His research areas include combinatorics (structural combinatorics, Ramsey theory), graph theory (coloring problems, sparse structures), algebra (representation
Jaroslav_Nešetřil
Sets big enough to assert the existence of arithmetic progressions with common difference
In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the
Large_set_(Ramsey_theory)
Statement in arithmetic combinatorics
In arithmetic combinatorics, the corners theorem states that for every ε > 0 {\displaystyle \varepsilon >0} , for large enough N {\displaystyle N} , any
Corners_theorem
RAMSEYS THEOREM
RAMSEYS THEOREM
Boy/Male
Hindu, Indian
Winter
Female
Egyptian
, the mother of Rameses.
Boy/Male
African, German, Hindu, Indian
Order of Ram
Surname or Lastname
English
English : habitational name from Romsey in Hampshire, so named from the genitive case of the Old English personal name Rūm (a short form of compound names with the first element rūm) + Old English ēg ‘island’, ‘dry land in a fen’.
Female
Egyptian
, a daughter of Rameses II.
Boy/Male
Arabic, Muslim
One who Raises Death
Female
Egyptian
, a daughter of Rameses-Miamun.
Female
Egyptian
, a daughter of Rameses II; & a wife of Rameses II.
Boy/Male
American, Australian, British, English, German, Scottish
Ram's Island
Male
Scottish
Variant spelling of Scottish Ramsay, RAMSEY means "wild-garlic island."
Boy/Male
Arabic, Muslim
Elevate; Raises
Boy/Male
Egyptian
Begotten by Ra the sun god.
Boy/Male
Egyptian
Name of a pharaoh.
Boy/Male
American, Australian, British, English, French, German, Scottish, Teutonic
Wild Garlic; From Ram's Island
Boy/Male
English American Teutonic Scottish
Wild garlic; from Ram's island.
Surname or Lastname
English
English : unexplained. Compare Racy, Racey.Possibly an altered spelling of Swiss German Rasi (see Rase 4) or of Dutch Rasy, a metonymic occupational name for someone who weighed out or measured corn, from Middle Dutch razier ‘corn measure’.
Boy/Male
Christian & English(British/American/Australian)
Island of Ravens
Boy/Male
American, Australian, British, English, German, Jamaican, Scottish, Teutonic
From Ram's Island; Wild Garlic Island
Surname or Lastname
English
English : probably a habitational name from a lost or unidentified place.Probably an altered spelling of German Rams(e)l, Dutch Ramsel, a habitational name from Ramsel in Antwerp province, Belgium; a group of people migrated from there to Swabia in 1570.In some instances the German name may have derived from a nickname for a roguish person.
Boy/Male
Arabic, Australian, German, Indian, Parsi
Loving
RAMSEYS THEOREM
RAMSEYS THEOREM
Male
Scottish
Scottish form of Irish Gaelic Eóghan, EÒGHAN means "born of yew."
Surname or Lastname
English
English : patronymic from Gelis, a variant of Giles, or possibly a patronymic or metronymic from a short form of Julian.
Girl/Female
Arabic, Muslim
Beginner
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi
Gift of Rama
Girl/Female
Indian
Cute
Boy/Male
Hindu, Indian, Tamil
A Cute Boy
Boy/Male
Tamil
Lord Buddha (Celebrity Name: Namrata Shirodkar and Mahesh Babu)
Boy/Male
Muslim
Kind, Friend
Boy/Male
Australian, Gaelic, Irish
Fair-haired Courageous One
Girl/Female
Greek Latin American French English
Christian.
RAMSEYS THEOREM
RAMSEYS THEOREM
RAMSEYS THEOREM
RAMSEYS THEOREM
RAMSEYS THEOREM
n.
One who constructs theorems.
n.
One who raises sheep for the production of wool.
v. t.
To formulate into a theorem.
n.
One who, or that which, raises (in various senses of the verb).
n.
One who raises coal out of the hold of a ship.
n.
One of the constituents of animal fats and also of some vegetable fats, as the butter of cacao. It is especially characterized by its solidity, so that when present in considerable quantity it materially increases the hardness, or raises the melting point, of the fat, as in mutton tallow. Chemically, it is a compound of glyceryl with three molecules of stearic acid, and hence is technically called tristearin, or glyceryl tristearate.
n.
A muscle which raises any part.
n.
A half vault; one of the seven artificial motions of a horse, in which he raises his fore legs in a particular manner.
n.
One who, or that which, raises or lifts up anything
n.
A tool used in mezzotint engraving, which, by a rocking motion, raises burrs on the surface of the plate, so preparing the ground.
n.
A numerical coefficient in any particular case of the binomial theorem.
a.
Alt. of Theorematical
a.
Of or pertaining to a theorem or theorems; comprised in a theorem; consisting of theorems.
n.
An erector; one who raises or builds.
n.
One who enhances; one who, or that which, raises the amount, price, etc.
n.
The large muscle which raises the under jaw, and assists in mastication.
n.
A particular leap of a horse, when he raises both his fore legs at once, equally advanced, and, as his fore legs are falling, raises his hind legs, so that all his legs are in the air at once.
a.
Theorematic.
n.
One who raises coal or merchandise with a tackle from a chip's hold.
n.
One who exalts or raises to dignity.