Forcing for hat inductive definitions in arithmetic (Q2922495): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the relationship between <i>ATR</i><sub>0</sub> and / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forcing in Proof Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Does reductive proof theory have a viable rationale? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed point theories and dependent choice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deduction-preserving "Recursive Isomorphisms" between theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forcing under Anti‐Foundation Axiom: An expression of the stalks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full and hat inductive definitions are equivalent in NBG / rank | |||
Normal rank |
Latest revision as of 03:09, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Forcing for hat inductive definitions in arithmetic |
scientific article |
Statements
Forcing for hat inductive definitions in arithmetic (English)
0 references
10 October 2014
0 references