Forcing for hat inductive definitions in arithmetic

DOI10.1002/malq.201300044zbMath1341.03089OpenAlexW1959175637MaRDI QIDQ2922495

Kentaro Sato

Publication date: 10 October 2014

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201300044

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Relative consistency and interpretations (03F25)

Related Items (1)

A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection

Cites Work

• Fixed point theories and dependent choice
• Does reductive proof theory have a viable rationale?
• Full and hat inductive definitions are equivalent in NBG
• Forcing in Proof Theory
• Forcing under Anti‐Foundation Axiom: An expression of the stalks
• Deduction-preserving "Recursive Isomorphisms" between theories
• On the relationship between ATR₀ and

This page was built for publication: Forcing for hat inductive definitions in arithmetic