Forcing for hat inductive definitions in arithmetic

Mathematical Logic Quarterly 60 (4-5):314-318 (2014)
  Copy   BIBTEX

Abstract

By forcing, we give a direct interpretation of into Avigad's. To the best of the author's knowledge, this is one of the simplest applications of forcing to “real problems”.

Categories

Keywords

Reprint years

DOI

10.1002/malq.201300044

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Inductive definitions over a predicative arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.
Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
Functional interpretation and inductive definitions.Jeremy Avigad & Henry Towsner - 2009 - Journal of Symbolic Logic 74 (4):1100-1120.
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
Ordinal analysis of non-monotone-definable inductive definitions.Wolfram Pohlers - 2008 - Annals of Pure and Applied Logic 156 (1):160-169.
Full and hat inductive definitions are equivalent in NBG.Kentaro Sato - 2015 - Archive for Mathematical Logic 54 (1-2):75-112.
Comparing inductive and circular definitions: Parameters, complexity and games.Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - Studia Logica 81 (1):79 - 98.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π₂⁰-operators.Toshiyasu Arai - 2004 - Journal of Symbolic Logic 69 (3):830-850.
A note on theories for quasi-inductive definitions.Riccardo Bruni - 2009 - Review of Symbolic Logic 2 (4):684-699.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
Non-deterministic inductive definitions.Benno van den Berg - 2013 - Archive for Mathematical Logic 52 (1-2):113-135.
Quantifiers, games and inductive definitions.Peter Aczel - 1975 - Journal of Symbolic Logic 82 (2):1--14.
Second order theories with ordinals and elementary comprehension.Gerhard Jäger & Thomas Strahm - 1995 - Archive for Mathematical Logic 34 (6):345-375.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.

Analytics

Added to PP
2015-09-03

Downloads
12 (#1,062,297)

6 months
7 (#418,426)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On the relationship between ATR 0 and.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768-779.
On the relationships between ATR0 and $\widehat{ID}_{.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768 - 779.
Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.

View all 6 references / Add more references