Forcing for hat inductive definitions in arithmetic

DOI10.1002/MALQ.201300044MaRDI QIDQ2922495zbMATH OpenOpenAlexFDO

Authors Kentaro Sato

Publication date 10 October 2014

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

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

Mathematics Subject Classification ID

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

Recommendations

• Forcing in Proof Theory
• Induction and inductive definitions in fragments of second order arithmetic
• Another reduction of classical ID_ to constructive ID^i_
• A Note on Shoenfield's Unramified Forcing
• Forcing and reductibilities. II. Forcing in fragments of analysis

Cites work

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

Cited in

(11)

• A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection
• A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines
• Reifying dynamical algebra: maximal ideals in countable rings, constructively

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922495)