This HTML5 document contains 33 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://gist.github.com/AndrasKovacs/
dbthttp://dbpedia.org/resource/Template:
n15https://www.springer.com/gp/book/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n12http://citeseerx.ist.psu.edu/viewdoc/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7https://www.sciencedirect.com/science/article/abs/pii/
n14http://en.wikipedia.org/wiki/
n9http://dbpedia.org/resource/Nlab:
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Buchholz's_ID_hierarchy
rdfs:label
Buchholz's ID hierarchy
rdfs:comment
In set theory and logic, Buchholz's ID hierarchy is a hierarchy of subsystems of first-order arithmetic. The systems/theories are referred to as "the formal theories of ν-times iterated inductive definitions". IDν extends PA by ν iterated least fixed points of monotone operators.
dbp:wikiPageUsesTemplate
dbt:Multiple_issues dbt:More_footnotes dbt:Technical dbt:Countable_ordinals
dct:subject
dbc:Mathematical_logic dbc:Ordinal_numbers dbc:Proof_theory dbc:Set_theory
dbo:wikiPageExternalLink
n7:S0049237X08707699 n7:S0049237X08708474 n10:8d445c8457ea0967e807c726b2ce5a3a n12:download%3Fdoi=10.1.1.573.420&rep=rep1&type=pdf n15:9783540111702
prov:wasDerivedFrom
n14:Buchholz's_ID_hierarchy?oldid=1064077505&ns=0
dbo:wikiPageID
68497153
dbo:wikiPageLength
12141
dbo:wikiPageRevisionID
1064077505
dbo:wikiPageWikiLink
dbc:Mathematical_logic dbr:Peano_axioms dbr:Second-order_arithmetic dbc:Ordinal_numbers n9:iterated+inductive+definitions n9:ordinal+analysis dbc:Set_theory dbr:Mathematical_logic dbc:Proof_theory dbr:Set_theory dbr:Takeuti–Feferman–Buchholz_ordinal dbr:Bachmann–Howard_ordinal
dbo:abstract
In set theory and logic, Buchholz's ID hierarchy is a hierarchy of subsystems of first-order arithmetic. The systems/theories are referred to as "the formal theories of ν-times iterated inductive definitions". IDν extends PA by ν iterated least fixed points of monotone operators.
foaf:isPrimaryTopicOf
n14:Buchholz's_ID_hierarchy