|
gptkbp:instanceOf
|
field of mathematical logic
|
|
gptkbp:appliesTo
|
gptkb:classical_mathematics
gptkb:algebra
gptkb:set_theory
analysis
combinatorics
|
|
gptkbp:class
|
reversing theorems to axioms
|
|
gptkbp:developedBy
|
gptkb:Stephen_Simpson
gptkb:Harvey_Friedman
|
|
gptkbp:goal
|
determine minimal axioms needed to prove theorems
|
|
gptkbp:hasConcept
|
base theory
conservation results
equivalence of theorems and axioms
implication and reversal
logical strength
mathematical subsystems
proof-theoretic analysis
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
reverse mathematics
|
|
gptkbp:mainSubsystems
|
gptkb:Π^1_1-CA_0
gptkb:ATR_0
ACA_0
RCA_0
WKL_0
|
|
gptkbp:notableContributor
|
gptkb:Stephen_Simpson
|
|
gptkbp:notablePublication
|
gptkb:Subsystems_of_Second_Order_Arithmetic
|
|
gptkbp:originatedIn
|
1970s
|
|
gptkbp:relatedTo
|
computability theory
foundations of mathematics
proof theory
|
|
gptkbp:setting
|
gptkb:second-order_arithmetic
|
|
gptkbp:studies
|
axiomatic strength of theorems
|
|
gptkbp:typicalQuestion
|
Which axioms are needed to prove a given theorem?
|
|
gptkbp:bfsParent
|
gptkb:Stephen_G._Simpson
gptkb:Formal_Logic
gptkb:Harry_Lawrence_Friedman
|
|
gptkbp:bfsLayer
|
6
|