AI & ChatGPT searches , social queriess for SECOND ORDER-ARITHMETIC
Search references for SECOND ORDER-ARITHMETIC. Phrases containing SECOND ORDER-ARITHMETIC
See searches and references containing SECOND ORDER-ARITHMETIC!
Search references for SECOND ORDER-ARITHMETIC. Phrases containing SECOND ORDER-ARITHMETIC
See searches and references containing SECOND ORDER-ARITHMETIC!SECOND ORDER-ARITHMETIC
Mathematical system
In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative
Second-order_arithmetic
Form of logic that allows quantification over predicates
second-order arithmetic and is thus undecidable. Just as in first-order logic, second-order logic may include non-logical symbols in a particular second-order language
Second-order_logic
Axioms for the natural numbers
between the second-order and first-order formulations, as discussed in the section § Peano arithmetic as first-order theory below. If the second-order induction
Peano_axioms
Theories in mathematical logic
of arithmetic in second order logic that is called second order arithmetic. It has only one model, unlike the corresponding theory in first-order logic
List_of_first-order_theories
Branch of mathematical logic
Reverse mathematics is usually carried out using subsystems of second-order arithmetic, where many of its definitions and methods are inspired by previous
Reverse_mathematics
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
Topics referred to by the same term
includes quadratic terms Second-order arithmetic, an axiomatization allowing quantification of sets of numbers Second-order differential equation, a differential
Second-order
Consistency of the axioms of arithmetic
stated that the axioms he considered for arithmetic were the ones given in Hilbert (1900), which include a second order completeness axiom. In the 1930s, Kurt
Hilbert's_second_problem
Limitative results in mathematical logic
theorem, is undecidable in (first-order) Peano arithmetic, but can be proved in the stronger system of second-order arithmetic. Kirby and Paris later showed
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Mathematical technique used in proof theory
transfinite induction of arithmetical statements for R {\displaystyle R} . Some theories, such as subsystems of second-order arithmetic (Z2), have no conceptualization
Ordinal_analysis
Well-quasi-ordering of finite trees
a statement that cannot be proved in ATR0 (a second-order arithmetic theory with a form of arithmetical transfinite recursion). In 2004, the result was
Kruskal's_tree_theorem
Type of logical system
first-order logic is an extension of propositional logic. A theory about a topic, such as set theory, a theory for groups, or a formal theory of arithmetic
First-order_logic
Theorem that arithmetical truth cannot be defined in arithmetic
the syntax of formal logic within first-order arithmetic. Each expression of the formal language of arithmetic is assigned a distinct number. This procedure
Tarski's undefinability theorem
Tarski's_undefinability_theorem
Decidable first-order theory of the natural numbers with addition
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929
Presburger_arithmetic
Branch of mathematical logic
Peano Arithmetic using transfinite induction up to ordinal ε0. Ordinal analysis has been extended to many fragments of first and second order arithmetic and
Proof_theory
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
Study of computable functions and Turing degrees
of second-order arithmetic and reverse mathematics. The field of proof theory includes the study of second-order arithmetic and Peano arithmetic, as
Computability_theory
German philosopher, logician, and mathematician (1848–1925)
∀x(Fx ↔ Gx). V* is consistent if second-order arithmetic is, and suffices to prove the axioms of second-order arithmetic. Basic Law V can simply be replaced
Gottlob_Frege
Ordinals in mathematics and set theory
are still fairly significant (in ascending order): The proof-theoretic ordinal of second-order arithmetic. A possible limit of Taranovsky's C ordinal
Large_countable_ordinal
Theorem on proofs and axiomatic systems
case of Kruskal's theorem and has a short proof in second order arithmetic. If one takes Peano arithmetic together with the negation of the statement above
Gödel's_speed-up_theorem
Possible axiom for set theory in mathematics
an analogue of the axiom of constructibility for subsystems of second-order arithmetic. A few results stand out in the study of such analogues: John Addison's
Axiom_of_constructibility
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
Hierarchy of complexity classes for formulas defining sets
In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy (after mathematicians Stephen Cole Kleene and Andrzej
Arithmetical_hierarchy
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
Logical principle
that HP and suitable definitions of arithmetical notions entail all axioms of what we now call second-order arithmetic. This result is known as Frege's theorem
Hume's_principle
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
Concept in mathematical logic and set theory
extension of the arithmetical hierarchy. The analytical hierarchy of formulas includes formulas in the language of second-order arithmetic, which can have
Analytical_hierarchy
Standard system of axiomatic set theory
be proven in much weaker systems than ZFC, such as Peano arithmetic and second-order arithmetic (as explored by the program of reverse mathematics). Saunders
Zermelo–Fraenkel_set_theory
Statement in mathematical combinatorics
arXiv:2011.00683 [math.CO]. Simpson, Stephen G. (2010). Subsystems of second order arithmetic. Perspectives in logic. Association for Symbolic Logic (2. ed.
Ramsey's_theorem
Theorem on extension of bounded linear functionals
the Hahn–Banach theorem follows from WKL0, a weak subsystem of second-order arithmetic that takes a form of Kőnig's lemma restricted to binary trees as
Hahn–Banach_theorem
Generalization of Turing computability
Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory
Hyperarithmetical_theory
Type of propositional logic
formula Second-order arithmetic Second-order logic Type theory Parigot, Michel (Dec 1997). "Proofs of strong normalisation for second order classical
Second-order propositional logic
Second-order_propositional_logic
Concept in mathematics
second-order arithmetic studied in reverse mathematics, is a conservative extension of first-order Peano arithmetic. The subsystems of second-order arithmetic
Conservative_extension
Book by John Stillwell
with respect to three of the "big five" subsystems of second-order arithmetic, namely arithmetical comprehension, recursive comprehension, and the weak
Reverse Mathematics: Proofs from the Inside Out
Reverse_Mathematics:_Proofs_from_the_Inside_Out
Topics referred to by the same term
group of order 2 GF(2), the Galois field of 2 elements, alternatively written as Z2 Z2, the standard axiomatization of second-order arithmetic Z² (album)
Z2
American mathematician (born 1948)
Congress of Mathematicians, with a talk titled "Some systems of second order arithmetic and their use", which established the field of reverse mathematics
Harvey Friedman (mathematician)
Harvey_Friedman_(mathematician)
Large countably-infinite ordinal number
ordinal of the subsystem Π 1 1 {\displaystyle \Pi _{1}^{1}} -CA0 of second-order arithmetic; this is one of the "big five" subsystems studied in reverse mathematics
Buchholz's_ordinal
Yes-or-no question that cannot ever be solved by a computer
axiomatization of arithmetic given by the Peano axioms but can be proven to be true in the larger system of second-order arithmetic. Kruskal's tree theorem
Undecidable_problem
Two-volume work by David Hilbert and Paul Bernays
1939, it presents fundamental mathematical ideas and introduced second-order arithmetic. 1934/1939 (Vol. I, II) First German edition, Springer 1944 Reprint
Grundlagen_der_Mathematik
Mathematical result on infinite trees
suitable vertex. In this case, Kőnig's lemma is provable in second-order arithmetic with arithmetical comprehension, and, a fortiori, in ZF set theory (without
Kőnig's_lemma
Statement that is taken to be true
actually prove all they need in systems weaker than ZFC, such as second-order arithmetic.[citation needed] The study of topology in mathematics extends
Axiom
Theorem in mathematical logic
out in second-order arithmetic. The Paris–Harrington theorem states that the strengthened finite Ramsey theorem is not provable in Peano arithmetic. Roughly
Paris–Harrington_theorem
Calculations where numbers' precision is only limited by computer memory
arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations
Arbitrary-precision arithmetic
Arbitrary-precision_arithmetic
Axiomatization of arithmetic
who first proposed it. Heyting arithmetic can be characterized just like the first-order theory of Peano arithmetic P A {\displaystyle {\mathsf {PA}}}
Heyting_arithmetic
Theorem in topology
"The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic", Archive for Mathematical Logic, 46 (5): 465–480, doi:10.1007/s00153-007-0050-6
Jordan_curve_theorem
Logical quantification that ranges over a subset of the universe of discourse
number Suppose that L is the language of Peano arithmetic (the language of second-order arithmetic or arithmetic in all finite types would work as well). There
Bounded_quantifier
Axiomatic set theories based on the principles of mathematical constructivism
weak so called second-order arithmetic theory R C A 0 {\displaystyle {\mathsf {RCA}}_{0}} , a subsystem of the two-sorted first-order theory Z 2 {\displaystyle
Constructive_set_theory
Class of "well-behaved" models in set theory
mathematics of subsystems of second-order arithmetic. In this context, a β-model of a subsystem of second-order arithmetic is a model M where for any Σ11
Beta-model
American mathematician (born 1954)
which conjectures that the partial order of the Turing degrees is logically equivalent to second-order arithmetic. They showed that the Bi-interpretability
Theodore_Slaman
Large countable ordinal
{\displaystyle \Pi _{1}^{1}{\textsf {-CA}}+{\textsf {BI}}} , a subsystem of second-order arithmetic Π 1 1 {\displaystyle \Pi _{1}^{1}} -comprehension + transfinite
Takeuti–Feferman–Buchholz ordinal
Takeuti–Feferman–Buchholz_ordinal
Syntactically correct logical formula
Dean, S. Walsh, The Prehistory of the Subsystems of Second-order Arithmetic (2016), p.6 First-order logic and automated theorem proving, Melvin Fitting
Well-formed_formula
Formalization of the natural numbers
recursive arithmetic Finite-valued logic Heyting arithmetic Peano arithmetic Primitive recursive function Robinson arithmetic Second-order arithmetic Skolem
Primitive recursive arithmetic
Primitive_recursive_arithmetic
Combinational digital circuit
In computing, an arithmetic logic unit (ALU) is a combinational digital circuit that performs arithmetic and bitwise operations on integer binary numbers
Arithmetic_logic_unit
Axiom of Zermelo-Fraenkel set theory
of second-order arithmetic, since the axiom of power set allows us to quantify over the power set of ω {\displaystyle \omega } , as in second-order logic
Axiom_of_infinity
Kind of proposition in mathematics
countable β k {\displaystyle \beta _{k}} -model of a subsystem of second-order arithmetic consists of a countable set of sets of natural numbers, which may
Reflection_principle
American writer and academic
algorithm for sequential machines and definability in monadic second-order arithmetic." He is best known for founding the CSNET project in 1979, which
Lawrence_Landweber
Keisler's order. What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Topics referred to by the same term
events during the Phanerozoic eon Big Five (arithmetic), five common subsystems of second order arithmetic in reverse mathematics Rule of big 5, an expansion
Big_Five
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
Being equally consistent
needs to be carefully addressed. For theories at the level of second-order arithmetic, the reverse mathematics program has much to say. Consistency strength
Equiconsistency
Book on mathematical logic
its topics include second-order logic (including its incompleteness and relation with Peano arithmetic), second-order arithmetic, type theory (in relational
Extensions of First Order Logic
Extensions_of_First_Order_Logic
Automaton which either accepts or rejects infinite inputs
{\textstyle A} . Büchi, J.R. (1962). "On a Decision Method in Restricted Second Order Arithmetic". The Collected Works of J. Richard Büchi. Stanford: Stanford University
Büchi_automaton
Axiomatic set theory devised by W.V.O. Quine
function arithmetic. P A {\displaystyle {\mathsf {PA}}} see Peano arithmetic. Z 2 {\displaystyle {\mathsf {Z}}_{2}} see Second-order arithmetic. Alternative
New_Foundations
Mathematical analysis
extensions of Heyting arithmetic by types including N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} , constructive second-order arithmetic, or strong enough
Constructive_analysis
Attempt to formalize all of mathematics, based on a finite set of axioms
a finitary proof of the consistency of Peano arithmetic. More powerful subsets of second-order arithmetic have been given consistency proofs by Gaisi Takeuti
Hilbert's_program
Extension of recursion theory to admissible ordinals beyond the natural numbers
{\displaystyle L} for the language of second-order arithmetic that consists of sets of integers. In fact, when dealing with first-order logic only, the correspondence
Alpha_recursion_theory
Digit transferred from one column to another
In elementary arithmetic, a carry is a digit that is transferred from one column of digits to another column of more significant digits. It is part of
Carry_(arithmetic)
Swiss mathematician (1888–1977)
of arithmetic. Bernays also lectured on other areas of mathematics at the University of Göttingen. In 1918, that university awarded him a second habilitation
Paul_Bernays
Mathematical function that can be computed by a program
by both a universal and existential formula in the language of second-order arithmetic and to some models of hypercomputation. Even more general recursion
Computable_function
Theorem in formal logic
second-order arithmetic in the sense that each of the statements can be derived from each other in the weak system of primitive recursive arithmetic (PRA)
Takeuti's_conjecture
Type of transfinite numbers
Peano arithmetic, along with Gödel's second incompleteness theorem, show that Peano arithmetic cannot prove the well-foundedness of this ordering (it is
Epsilon_number
Type of average of a collection of numbers
In mathematics and statistics, the arithmetic mean ( /ˌærɪθˈmɛtɪk/ arr-ith-MET-ik), arithmetic average, or just the mean or average is the sum of a collection
Arithmetic_mean
Notion of self-reference in mathematics and philosophy
theories at some length, in the context of Frege's logic, Peano arithmetic, second-order arithmetic, and axiomatic set theory. Gödel, Escher, Bach Impredicative
Impredicativity
Measure of unsolvability
⟩ or ⟨ ≤, ′, = ⟩ is many-one equivalent to the theory of true second-order arithmetic. This indicates that the structure of D {\displaystyle {\mathcal
Turing_degree
Set-theoretic function
ordinal-theoretic strength of certain formal systems, typically subsystems of second-order arithmetic (such as those seen in reverse mathematics), extensions of Kripke–Platek
Ordinal_collapsing_function
is a special case of Kruskal's theorem and has a short proof in second order arithmetic. List of incomplete proofs Proof by intimidation Lamb, Evelyn (26
List of long mathematical proofs
List_of_long_mathematical_proofs
In first-order arithmetic, the induction principles, bounding principles, and least number principles are three related families of first-order principles
Induction, bounding and least number principles
Induction,_bounding_and_least_number_principles
Study of mathematical analysis seen through computability theory
Physics, Springer-Verlag. Stephen G. Simpson (1999), Subsystems of second-order arithmetic. Klaus Weihrauch (2000), Computable analysis, Springer, ISBN 3-540-66817-9
Computable_analysis
Mathematical function on ordinals
Veblen Function, arXiv:2310.12832 Stephen G. Simpson, Subsystems of Second-order Arithmetic (2009, p.387) M. Rathjen, Ordinal notations based on a weakly Mahlo
Veblen_function
English mathematician (1912–1985)
found to be unprovable in Peano arithmetic but provable in stronger logical systems (such as second-order arithmetic). He also introduced a variant of
Reuben_Goodstein
Fraction with denominator a power of two
mathematical analysis to be proven within a restricted theory of second-order arithmetic called "feasible analysis" (BTFA). The surreal numbers are generated
Dyadic_rational
Assignment of meaning to the symbols of a formal language
for second-order arithmetic in which there is only an equality relation for numbers, but not an equality relation for set of numbers. The second approach
Interpretation_(logic)
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
Form of entropy encoding used in data compression
Arithmetic coding (AC) is a form of entropy coding used in lossless data compression. Normally, a string of characters is represented using a fixed number
Arithmetic_coding
2014 book by Denis Hirschfeldt
axiom schemes needed to prove them, and the big five subsystems of second-order arithmetic into which many theorems of mathematics have been classified. These
Slicing_the_Truth
Subfield of mathematical logic
weaker versions of set theory such as Kripke–Platek set theory and second-order arithmetic. Pointclass Prewellordering Scale property Kechris, Alexander S
Descriptive_set_theory
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
Computer approximation for real numbers
In computing, floating-point arithmetic (FP) is arithmetic on subsets of real numbers formed by a significand (a signed sequence of a fixed number of
Floating-point_arithmetic
Models of computation
more complicated models he was able to give an interpretation of second-order arithmetic. These models require an uncomputable input, such as a physical
Hypercomputation
Concept in set theory
mathematics. Indeed, Zermelo set theory (Z) already can interpret second-order arithmetic and much of type theory in finite types, which in turn are sufficient
Axiom_schema_of_replacement
Template that specifies one or more axioms
first-order theories can be replaced by single axioms in a higher-order language. For example, the first-order induction schema for arithmetic has a second-order
Axiom_schema
Arithmetic mean is greater than or equal to geometric mean
mathematics, the inequality of arithmetic and geometric means, or more briefly the AM–GM inequality, states that the arithmetic mean of a list of non-negative
AM–GM_inequality
Mathematical logic concept
by Gerhard Gentzen in 1936. It shows that the Peano axioms of first-order arithmetic do not contain a contradiction (i.e. are "consistent"), as long as
Gentzen's_consistency_proof
Type of Turing reduction
{\displaystyle {\mathcal {D}}_{m}} is isomorphic to the theory of second-order arithmetic. There is a characterization of D m {\displaystyle {\mathcal {D}}_{m}}
Many-one_reduction
Non-contradiction of a theory
arithmetic (PA) and primitive recursive arithmetic (PRA), but not to Presburger arithmetic. Moreover, Gödel's second incompleteness theorem shows that the
Consistency
sentences. A single second-order quantifier can be used to propose an arithmetic (or other) computation, which can be verified using first-order quantifiers if
S2S_(mathematics)
Class of alternative set theories
elements at all, which boosts the theory from the strength of second order arithmetic to the strength of Morse–Kelley set theory with the proper class
Positive_set_theory
Polish mathematician and computer scientist
models of second-order arithmetic, the impredicative theory of Kelley–Morse classes. He proved that the so-called Fraïssé conjecture (second-order theories
Victor_W._Marek
Function whose domain is the positive integers
e ( x ) {\displaystyle \log _{e}(x)} . In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain
Arithmetic_function
On coloring infinite graphs
graphs can also be shown to be equivalent in axiomatic power, in second-order arithmetic, to a weak form of Kőnig's lemma stating that every infinite binary
De Bruijn–Erdős theorem (graph theory)
De_Bruijn–Erdős_theorem_(graph_theory)
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
Boy/Male
Greek
Order.
Boy/Male
Tamil
Pradarsh | பà¯à®°à®¤à®°à¯à®·
Appearance, Order
Pradarsh | பà¯à®°à®¤à®°à¯à®·
Boy/Male
Greek
Order.
Surname or Lastname
English
English : variant of Cordier.Catalan : occupational name for a maker of cord or string, from an agent derivative of Catalan corda ‘string’, ‘cord’.
Girl/Female
Indian, Marathi, Sindhi
Order
Girl/Female
Indian, Traditional
Order
Male
English
Variant spelling of Middle English Estmond, ESMOND means "gracious protector."Â
Girl/Female
Greek
Order.
Boy/Male
Australian, French, German, Greek
Order
Surname or Lastname
English
English : topographic name for someone who lived at the edge of a village or by some other boundary, Middle English border, from Old French bordure ‘edge’.
Girl/Female
German, Greek
Order
Boy/Male
Hindu, Indian, Punjabi, Sikh
Order
Boy/Male
Greek
Order.
Boy/Male
Indian
Order, Decree
Girl/Female
Australian, French, German, Greek, Italian
Order
Female
English
Anglicized form of Scottish Gaelic Seònaid, SEONA means "God is gracious."
Male
Irish
Older form of Irish Gaelic Seachlainn, SEACHNALL means "second."
Girl/Female
Indian, Telugu
Order
Male
Swedish
Old Swedish form of Old Norse Oddr, ODDER means "point of a weapon."
Boy/Male
Arabic, Australian, Muslim
Order
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
Boy/Male
Greek
A priest of Apollo.
Boy/Male
English German
Strong as a bear.
Girl/Female
Christian & English(British/American/Australian)
Amiable
Male
Dutch
, people's ruler.
Girl/Female
Hindu
Boy/Male
Muslim/Islamic
Famous
Boy/Male
American, Australian, British, Chinese, English
Abbreviation of Nicholas; Mythological Nike was Greek Goddess of Victory and Root Origin of Nicholas
Girl/Female
Hindu, Indian
Creation of God
Boy/Male
Hindu, Indian, Punjabi, Sikh
God of Spiritually
Girl/Female
Tamil
Vigilance, Awareness
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
SECOND ORDER-ARITHMETIC
n.
One who seconds or supports what another attempts, affirms, moves, or proposes; as, the seconder of an enterprise or of a motion.
a.
Immediately following the first; next to the first in order of place or time; hence, occuring again; another; other.
n.
To give an order for; to secure by an order; as, to order a carriage; to order groceries.
v. i.
To give orders; to issue commands.
imp. & p. p.
of Second
adv.
Secondly; in the second place.
a.
To follow or attend for the purpose of assisting; to support; to back; to act as the second of; to assist; to forward; to encourage.
n.
To give an order to; to command; as, to order troops to advance.
n.
A body of persons having some common honorary distinction or rule of obligation; esp., a body of religious persons or aggregate of convents living under a common rule; as, the Order of the Bath; the Franciscan order.
a.
Of the rank or degree below the best highest; inferior; second-rate; as, a second-class house; a second-class passage.
adv.
In the second place.
a.
Being of the same kind as another that has preceded; another, like a protype; as, a second Cato; a second Troy; a second deluge.
a.
Having the power of second-sight.
n.
The second part in a concerted piece; -- often popularly applied to the alto.
n.
Right arrangement; a normal, correct, or fit condition; as, the house is in order; the machinery is out of order.
n.
The second part in a concerted piece.
a.
Of the second size, rank, quality, or value; as, a second-rate ship; second-rate cloth; a second-rate champion.
v. t.
To order a second time.
a.
The sixtieth part of a minute of time or of a minute of space, that is, the second regular subdivision of the degree; as, sound moves about 1,140 English feet in a second; five minutes and ten seconds north of this place.
n.
Rank; degree; thus, the order of a curve or surface is the same as the degree of its equation.