AI & ChatGPT searches , social queriess for ORDINAL ARITHMETIC
Search references for ORDINAL ARITHMETIC. Phrases containing ORDINAL ARITHMETIC
See searches and references containing ORDINAL ARITHMETIC!
Search references for ORDINAL ARITHMETIC. Phrases containing ORDINAL ARITHMETIC
See searches and references containing ORDINAL ARITHMETIC!ORDINAL ARITHMETIC
Operations on ordinals that extend classical arithmetic
In the mathematical field of set theory, ordinal arithmetic includes binary operations on ordinal numbers such as addition, multiplication, and exponentiation
Ordinal_arithmetic
Size of a possibly infinite set
{\displaystyle \omega _{n}} ). Infinite initial ordinals are limit ordinals. Using ordinal arithmetic, α < ω β {\displaystyle \alpha <\omega _{\beta }}
Cardinal_number
Generalization of "n-th" to infinite cases
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite
Ordinal_number
Ordinals in mathematics and set theory
the focus on countable ordinals, ordinal arithmetic is used throughout, except where otherwise noted. The ordinals described here are not as large as
Large_countable_ordinal
Type of transfinite numbers
numbers were introduced by Georg Cantor in the context of ordinal arithmetic; they are the ordinal numbers ε that satisfy the equation ε = ω ε , {\displaystyle
Epsilon_number
Formalization of the natural numbers
the proof-theoretic ordinal of Peano arithmetic. PRA's proof theoretic ordinal is ωω, where ω is the smallest transfinite ordinal. PRA is sometimes called
Primitive recursive arithmetic
Primitive_recursive_arithmetic
Mathematical technique used in proof theory
interpret a sufficient portion of arithmetic to make statements about ordinal notations. The proof-theoretic ordinal of such a theory T {\displaystyle
Ordinal_analysis
System of arithmetic in proof theory
elementary function arithmetic (EFA), also called elementary arithmetic and exponential function arithmetic, is the system of arithmetic with the usual elementary
Elementary function arithmetic
Elementary_function_arithmetic
Infinite ordinal number class
limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less
Limit_ordinal
Mathematician (1845–1918)
of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact
Georg_Cantor
Type of mathematical function
once again, not qualifying as a recursive ordinal notation. Large countable ordinals Ordinal arithmetic Ordinal analysis Rathjen, Michael (1 August 2023)
Ordinal_notation
Smallest ordinal number that, considered as a set, is uncountable
counterexamples in topology. Epsilon numbers (mathematics) Large countable ordinal Ordinal arithmetic "Set Theory > Basic Set Theory (Stanford Encyclopedia of Philosophy)"
First_uncountable_ordinal
Branch of mathematical logic
finite ordinals). An ω-model is a model for a fragment of second-order arithmetic whose first-order part is the standard model of Peano arithmetic, but
Reverse_mathematics
Axioms for the natural numbers
Poincaré turned to see whether logicism could generate arithmetic, more precisely, the arithmetic of ordinals. Couturat, said Poincaré, had accepted the Peano
Peano_axioms
Mathematical concept
of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and
Transfinite_induction
Axiomatic set theories based on the principles of mathematical constructivism
definition of the ordinals, and even a Δ 0 {\displaystyle \Delta _{0}} -formulation. Set induction in turn enables ordinal arithmetic in this sense. It
Constructive_set_theory
Number used for counting
properties of ordinal numbers: each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent
Natural_number
Operation on ordinal numbers
an ordinal number α is the smallest ordinal number greater than α. An ordinal number that is a successor is called a successor ordinal. The ordinals 1
Successor_ordinal
1958 book by Wacław Sierpiński
types, well-orders, ordinal numbers, ordinal arithmetic, and the Burali-Forti paradox according to which the collection of all ordinal numbers cannot be
Cardinal_and_Ordinal_Numbers
Mathematical logic concept
called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite induction up to the ordinal ε0", is neither weaker nor
Gentzen's_consistency_proof
Branch of mathematical logic
well-founded ordinals. Ordinal analysis was originated by Gentzen, who proved the consistency of Peano Arithmetic using transfinite induction up to ordinal ε0.
Proof_theory
1976 mathematics book by John Conway
arithmetic: addition, subtraction, multiplication, division and inequality. This allows an axiomatic construction of numbers and ordinal arithmetic,
On_Numbers_and_Games
Set theory concept
smallest ordinal number greater than the ranks of all members of the set. In particular, the rank of the empty set is zero, and every ordinal has a rank
Von_Neumann_universe
Well-quasi-ordering of finite trees
1-CA0. Ordinal analysis confirms the strength of Kruskal's theorem, with the proof-theoretic ordinal of the theorem equaling the small Veblen ordinal (sometimes
Kruskal's_tree_theorem
Distinction between nominal, ordinal, interval and ratio variables
best-known classification with four levels, or scales, of measurement: nominal, ordinal, interval, and ratio. This framework of distinguishing levels of measurement
Level_of_measurement
Consistency of the axioms of arithmetic
initiated the program of ordinal analysis in proof theory. In this program, formal theories of arithmetic or set theory are assigned ordinal numbers that measure
Hilbert's_second_problem
Large countably-infinite ordinal number
particular, it is the proof-theoretic ordinal of the subsystem Π 1 1 {\displaystyle \Pi _{1}^{1}} -CA0 of second-order arithmetic; this is one of the "big five"
Buchholz's_ordinal
Generalization of addition, multiplication, exponentiation, tetration, etc.
Powers of zero or Zero to the power of zero. Ordinal addition is not commutative; see ordinal arithmetic for more information This implements the leftmost-innermost
Hyperoperation
stuck at limit ordinals, so the notion of indecomposable beyond exponentiation is not useful. Ordinal arithmetic A. Rhea, "The Ordinals as a Consummate
Additively indecomposable ordinal
Additively_indecomposable_ordinal
Generalization of the real numbers
of the surreals. The surreals also contain all transfinite ordinal numbers; the arithmetic on them is given by the natural operations. It has also been
Surreal_number
Branch of elementary mathematics
Arithmetic is an elementary branch of mathematics that deals with numerical operations like addition, subtraction, multiplication, and division. In a wider
Arithmetic
Set-theoretic function
are used to describe the ordinal-theoretic strength of certain formal systems, typically subsystems of second-order arithmetic (such as those seen in reverse
Ordinal_collapsing_function
Integers have unique prime factorizations
In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every
Fundamental theorem of arithmetic
Fundamental_theorem_of_arithmetic
power (see ordinal arithmetic) of any two given notations in Kleene's O {\displaystyle {\mathcal {O}}} ; and given any notation for an ordinal, there is
Kleene's_O
paradox arithmetic The ordinal arithmetic is arithmetic on ordinal numbers The cardinal arithmetic is arithmetic on cardinal numbers arithmetical The arithmetical
Glossary_of_set_theory
Class of mathematical orderings
generalization Ordinal number Well-founded set Well partial order Prewellordering Directed set Manolios P, Vroon D. Algorithms for Ordinal Arithmetic. International
Well-order
Single, ordinal psychometric scale
the Guttman scale shown below in Table 2: Table 2. Data of the four ordinal arithmetic skill variables are hypothesized to form a Guttman scale The set profiles
Guttman_scale
Large countable ordinal
Feferman–Schütte ordinal (Γ0) is a large countable ordinal. It is the proof-theoretic ordinal of several mathematical theories, such as arithmetical transfinite
Feferman–Schütte_ordinal
Number that is larger than all finite numbers
\omega ^{\omega }} are larger still. Arithmetic expressions containing ω {\displaystyle \omega } specify an ordinal number, and can be thought of as the
Transfinite_number
Limitative results in mathematical logic
Gentzen proved the consistency of Peano arithmetic in a different system that includes an axiom asserting that the ordinal called ε0 is wellfounded; see Gentzen's
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Ordinal-indexed family of rapidly increasing functions
countable ordinal such that to every limit ordinal α < μ there is assigned a fundamental sequence (a strictly increasing sequence of ordinals whose supremum
Fast-growing_hierarchy
Standard system of axiomatic set theory
of infinity, replacement, and union, this implies that every set has an ordinal rank.[citation needed] Subsets are commonly constructed using set builder
Zermelo–Fraenkel_set_theory
Mathematical system
first-order arithmetic (which does not permit class variables at all). In particular it has the same proof-theoretic ordinal ε0 as first-order arithmetic, owing
Second-order_arithmetic
Theorem about natural numbers
theorem is unprovable in Peano arithmetic (but it can be proven in stronger systems, such as second-order arithmetic or Zermelo–Fraenkel set theory)
Goodstein's_theorem
3-volume treatise on mathematics, 1910–1913
20th century. The Principia covered only set theory, cardinal numbers, ordinal numbers, and real numbers. Deeper theorems from real analysis were not
Principia_Mathematica
Polish-Jewish mathematician and logician
He published works on mathematical logic, set theory, cardinal and ordinal arithmetic, the axiom of choice, the continuum hypothesis, theory of functions
Adolf_Lindenbaum
Arithmetic operation
denoted with the plus sign +, is one of the four basic operations of arithmetic, the other three being subtraction, multiplication, and division. The
Addition
Large countable ordinal
theory and proof theory, the Takeuti–Feferman–Buchholz ordinal (TFBO) is a large countable ordinal, which acts as the limit of the range of Buchholz's psi
Takeuti–Feferman–Buchholz ordinal
Takeuti–Feferman–Buchholz_ordinal
Natural number
1088/0026-1394/31/6/013. Peano, Giuseppe (1889). Arithmetices principia, nova methodo exposita [The principles of arithmetic, presented by a new method]. An excerpt
1
Order type of the set of all recursive ordinals
non-recursive ordinals are large countable ordinals greater than all the recursive ordinals, and therefore can not be expressed using recursive ordinal notations
Nonrecursive_ordinal
Particular class of sets which can be described entirely in terms of simpler sets
von Neumann universe, V {\displaystyle V} . The stages are indexed by ordinals. In von Neumann's universe, at a successor stage, one takes V α + 1 {\displaystyle
Constructible_universe
Branch of mathematics that studies sets
a theory of transfinite numbers, called cardinals and ordinals, which extended the arithmetic of the natural numbers. His notation for the cardinal numbers
Set_theory
Generalization of Turing computability
ordinal notation, which is a concrete, effective description of the ordinal. An ordinal notation is an effective description of a countable ordinal by
Hyperarithmetical_theory
cardinalities, just as the "standard" ordinals seem to be the strongly cantorian ordinals. Now the usual theorems of cardinal arithmetic with the axiom of choice can
Implementation of mathematics in set theory
Implementation_of_mathematics_in_set_theory
Isomorphism type of ordered sets
identified with the corresponding ordinal. Order types thus often take the form of arithmetic expressions of ordinals. Firstly, the order type of the set
Order_type
Mathematical concept
"size". Cantor defined two kinds of infinite numbers: ordinal numbers and cardinal numbers. Ordinal numbers characterize well-ordered sets, or counting
Infinity
Function of ordinals in mathematics
given by f (α) = 1 + α (see ordinal arithmetic). But f (α) = α + 1 is not normal because it is not continuous at any limit ordinal (for example, f ( ω ) =
Normal_function
Basic framework of mathematics
recursive arithmetic with an additional axiom asserting the existence of a certain ordinal number. This proof also started a program of similar ordinal analysis
Foundations_of_mathematics
In mathematics, ordinal logic is a logic associated with an ordinal number by recursively adding elements to a sequence of previous logics. The concept
Ordinal_logic
Axiomatic logical system
In mathematics, Robinson arithmetic is a finitely axiomatized fragment of first-order Peano arithmetic (PA), first set out by Raphael M. Robinson in 1950
Robinson_arithmetic
Last letter of the Greek alphabet
of functions. Chaitin's constant. In set theory, the first uncountable ordinal number, ω1 or Ω. The absolute infinite proposed by Georg Cantor. As part
Omega
developmental psychology or non-human primate experiments, ordinal numerical competence or ordinal numerical knowledge is the ability to count objects in
Ordinal_numerical_competence
Infinite cardinal number
infinite cardinal number ℵ α {\displaystyle \aleph _{\alpha }} for every ordinal number α , {\displaystyle \alpha ,} as described below. The concept and
Aleph_number
Ancient mathematical principle
beyond infinity, neither satisfies both properties simultaneously. In ordinal arithmetic, addition is left-cancellative, but no longer commutative. For example
Principle_of_permanence
Possible axiom for set theory in mathematics
the initial ordinals of those large cardinals (when they exist in a supermodel of L {\displaystyle L} ), and they are still initial ordinals in L {\displaystyle
Axiom_of_constructibility
Real number uniquely specified by description
definability comes from the formal theories of arithmetic, such as Peano arithmetic. The language of arithmetic has symbols for 0, 1, the successor operation
Definable_real_number
Non-contradiction of a theory
falsity, there is no contradiction in general. In theories of arithmetic, such as Peano arithmetic, there is an intricate relationship between the consistency
Consistency
Countable ordinal that is the order type of a computable well-ordering of natural numbers
have an ordinal notation in Kleene's O {\displaystyle {\mathcal {O}}} . Arithmetical hierarchy Large countable ordinal Ordinal analysis Ordinal notation
Computable_ordinal
Symbolic description of a mathematical object
See: Computer algebra expression A computation is any type of arithmetic or non-arithmetic calculation that is "well-defined". The notion that mathematical
Expression_(mathematics)
Form of mathematical proof
single step. To prove that a statement P(n) holds for each ordinal number: Show, for each ordinal number n, that if P(m) holds for all m < n, then P(n) also
Mathematical_induction
Set of all true first-order statements about the arithmetic of natural numbers
In mathematical logic, true arithmetic is the set of all true first-order statements about the arithmetic of natural numbers. This is the theory associated
True_arithmetic
Counting from "0" instead of "1" first
element, rather than the first element; zeroth is a coined word for the ordinal number zero. In some cases, an object or value that does not (originally)
Zero-based_numbering
Fundamental theorem in mathematical logic
Peano arithmetic. Precisely, we can systematically define a model of any consistent computably axiomatisable first-order theory T in Peano arithmetic by
Gödel's_completeness_theorem
used for counting are "cardinal numbers" and words used for ordering are "ordinal numbers". Defined by the Peano axioms, the natural numbers form an infinitely
List_of_numbers
Number
consequently dividing by 0 is generally considered to be undefined in arithmetic. As a numerical digit, 0 plays a crucial role in decimal notation: it
0
phenomenon after this case. Von Osten claimed that his horse could perform arithmetic operations presented to the horse in writing or verbally, upon which the
Number_sense_in_animals
Number used in combinatorial game theory
games. However, nimbers are distinct from ordinal and surreal numbers in that they follow distinct arithmetic rules, nim-addition and nim-multiplication
Nimber
Type of infinite number in set theory
operations. An ordinal is a weakly inaccessible cardinal if and only if it is a regular ordinal and it is a limit of regular ordinals. (Zero, one, and
Inaccessible_cardinal
Axiom of set theory
minimum element). Consequently, every cardinal has an initial ordinal. For every ordinal α {\displaystyle \alpha } , the powerset (i.e., the set of all
Axiom_of_choice
Subfield of mathematics
proof-theoretic ordinals, which became key tools in proof theory. Gödel gave a different consistency proof, which reduces the consistency of classical arithmetic to
Mathematical_logic
Theories in mathematical logic
fragments of Peano arithmetic. The case n = 1 has about the same strength as primitive recursive arithmetic (PRA). Exponential function arithmetic (EFA) is IΣ0
List_of_first-order_theories
Theorem that arithmetical truth cannot be defined in arithmetic
formal semantics. Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic". The theorem applies more generally to any sufficiently
Tarski's undefinability theorem
Tarski's_undefinability_theorem
Size of a set in mathematics
\omega } the desired property of being the smallest ordinal greater than all finite ordinal numbers. Further, ω + 1 := { 0 , 1 , ⋯ , ω } {\displaystyle
Cardinality
examples of near-semirings. Another example is the ordinals under the usual operations of ordinal arithmetic (here Clause 3 should be replaced with its symmetric
Near-semiring
Function in mathematical logic
natural numbers, facilitating their manipulation in formal theories of arithmetic. Since the publishing of Gödel's paper in 1931, the term "Gödel numbering"
Gödel_numbering
Mathematical function on ordinals
functions from ordinals to ordinals), introduced by Oswald Veblen in Veblen (1908). If φ0 is any normal function, then for any non-zero ordinal α, φα is the
Veblen_function
1938 doctoral thesis by Alan Turing
Systems of Logic Based on Ordinals was the PhD dissertation of the mathematician Alan Turing. The thesis was completed at Princeton under Alonzo Church
Systems of Logic Based on Ordinals
Systems_of_Logic_Based_on_Ordinals
Preference ranking
In economics, an ordinal utility function is a function representing the preferences of an agent on an ordinal scale. Ordinal utility theory claims that
Ordinal_utility
German mathematician (1896–1962)
coding Ackermann function Ackermann ordinal Ackermann set theory Hilbert–Ackermann system Entscheidungsproblem Ordinal notation Inverse Ackermann function
Wilhelm_Ackermann
Model of (first-order) Peano arithmetic that contains non-standard numbers
non-standard model of arithmetic is a model of first-order Peano arithmetic that contains non-standard numbers. The term standard model of arithmetic refers to the
Non-standard model of arithmetic
Non-standard_model_of_arithmetic
Collection of sets in mathematics that can be defined based on a property of its members
set is sometimes called a small class. For instance, the class of all ordinal numbers, and the class of all sets, are proper classes in many formal systems
Class_(set_theory)
Third letter of the Greek alphabet
machine The Feferman–Schütte ordinal Γ 0 {\displaystyle \Gamma _{0}} Congruence subgroups of the modular group of other arithmetic groups One of the Greeks
Gamma
Extension of recursion theory to admissible ordinals beyond the natural numbers
theory is a generalisation of recursion theory to subsets of admissible ordinals α {\displaystyle \alpha } . An admissible set is closed under Σ 1 ( L α
Alpha_recursion_theory
limit ordinal. It is also denoted ω 0 {\displaystyle \omega _{0}} and can be identified with the ordered set of the natural numbers. 2. With an ordinal i
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
Quasi-infinite number in mathematics
assigned a different value from both Cantor's aleph number ℵ0 and the ordinal number ω, and it also differs from the general symbol for infinity ∞ by
Grossone
Mathematical set containing no elements
In the von Neumann construction of the ordinals, 0 is defined as the empty set, and the successor of an ordinal is defined as S ( α ) = α ∪ { α } {\displaystyle
Empty_set
Type of cardinal number in mathematics
infinite ordinal α {\displaystyle \alpha } is a regular ordinal if it is a limit ordinal that is not the limit of a set of smaller ordinals that as a
Regular_cardinal
Study of collection and analysis of data
measurement. The psychophysicist Stanley Smith Stevens defined nominal, ordinal, interval, and ratio scales. Nominal measurements do not have meaningful
Statistics
Type of logical system
topic, such as set theory, a theory for groups, or a formal theory of arithmetic, is usually a first-order logic together with a specified domain of discourse
First-order_logic
Infinite set that is not countable
more abstract example of an uncountable set is the set of all countable ordinal numbers, denoted by Ω or ω1. The cardinality of Ω is denoted ℵ 1 {\displaystyle
Uncountable_set
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
Girl/Female
Indian
Girl/Female
French
Gold.
Girl/Female
Hindu, Indian, Marathi
Pleased; Satisfied
Female
African
common, ordinay.
Girl/Female
Australian, Latin
Little Wave
Girl/Female
Tamil
Sweet girl, Variant of donald great chief
Girl/Female
Hindu
Girl/Female
Gujarati, Hindu, Indian
Brave
Surname or Lastname
English
English : variant of Ordway.
Girl/Female
Latin
Ardent. Eager. Industrious.
Girl/Female
Australian, Latin
Golden
Girl/Female
Australian, Greek, Hebrew
Peace
Female
Italian
Feminine form of Italian Orsino, ORSINA means "bear-like."
Girl/Female
Indian
Sweet girl, Variant of donald great chief
Surname or Lastname
English
English : variant of Cordell.
Girl/Female
Arabic
Pride
Girl/Female
Hindu, Indian
Great Chief; Variant of Donald
Female
Scottish
Scottish feminine form of English Rodney, RODINA means "Hroda's fen/island."
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Punjabi, Sanskrit, Sikh
Lotus
Surname or Lastname
English, French, Spanish, and Dutch
English, French, Spanish, and Dutch : from Middle English, Old French cardinal ‘cardinal’, the church dignitary (Latin cardinalis, originally an adjective meaning ‘crucial’). The surname may have denoted a servant who worked in a cardinal’s household, but was probably more often bestowed as a nickname on someone who habitually dressed in red or who had played the part of a cardinal in a pageant, or on one who acted in a lordly and patronizing manner, like a prince of the Church.A bearer of the name, of unknown origin, is documented in Montreal by 1666.
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
Girl/Female
Hindu, Indian, Sanskrit, Tamil
Caring; Divine; Lovable
Boy/Male
Sikh
Brave and famous
Girl/Female
British, English, Scandinavian, Swedish
Pure
Boy/Male
African, British, English, German
Royal
Boy/Male
Biblical
A comforter; a leader.
Girl/Female
Hindu, Indian, Tamil, Traditional
Pure; Depth in Character
Girl/Female
Muslim
Fruitfulness, Plenty
Surname or Lastname
English
English : habitational name from any of various places so called. One in Wiltshire was named in Old English ‘valley at a boundary’, from mearc ‘boundary’ + denu ‘valley’; one in Sussex was named as ‘boundary hill’ (Old English (ge)mǣre ‘boundary’ + dūn ‘hill’); one in Kent was named ‘mares’ pasture’ (Old English m(i)ere ‘mares’ + denn ‘pasture’); while the one in Herefordshire was named with British magno- ‘plain’ + Old English worðign ‘enclosure’.
Surname or Lastname
English (of Norman origin)
English (of Norman origin) : from a Norman French dialect form of the common French place name Beaulieu.
Boy/Male
Indian, Kannada, Marathi, Tamil
Another Name for God Pillaiyar; Elephant-headed
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
ORDINAL ARITHMETIC
a.
Pertaining to the origin or beginning; preceding all others; first in order; primitive; primary; pristine; as, the original state of man; the original laws of a country; the original inventor of a process.
a.
Of or pertaining to an order.
a.
Having the power to suggest new thoughts or combinations of thought; inventive; as, an original genius.
n.
An original thinker or writer; an originator.
n.
That which precedes all others of its class; archetype; first copy; hence, an original work of art, manuscript, text, and the like, as distinguished from a copy, translation, etc.
n.
The state or quality of being ordinal.
n.
Any invigorating and stimulating preparation; as, a peppermint cordial.
n.
A book containing the rubrics of the Mass.
n.
Anything which is in ordinary or common use.
n.
A word or number denoting order or succession.
a.
Indicating order or succession; as, the ordinal numbers, first, second, third, etc.
n.
The book of forms for making, ordaining, and consecrating bishops, priests, and deacons.
a.
Of or pertaining to trial by ordeal.
n.
An officer who has original jurisdiction in his own right, and not by deputation.
a.
Of common rank, quality, or ability; not distinguished by superior excellence or beauty; hence, not distinguished in any way; commonplace; inferior; of little merit; as, men of ordinary judgment; an ordinary book.
n.
The natural or wild species from which a domesticated or cultivated variety has been derived; as, the wolf is thought by some to be the original of the dog, the blackthorn the original of the plum.
a.
Not copied, imitated, or translated; new; fresh; genuine; as, an original thought; an original process; the original text of Scripture.
n.
Ordeal.
a.
Before unused or unknown; new; as, a book full of original matter.