WKL 0 and induction principles in model theory

Annals of Pure and Applied Logic 166 (7-8):767-799 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.04.001

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

Unifying the model theory of first-order and second-order arithmetic via WKL 0 ⁎.Ali Enayat & Tin Lok Wong - 2017 - Annals of Pure and Applied Logic 168 (6):1247-1283.
Paris-Harrington principles, reflection principles and transfinite induction up to epsilon 0.Reijiro Kurata - 1986 - Annals of Pure and Applied Logic 31:237.
Some combinatorial principles equivalent to restrictions of transfinite induction up to "GAMMA"0.R. Kurata - 1989 - Annals of Pure and Applied Logic 44 (1/2):63.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
A Π12 singleton incompatible with 0#.M. C. Stanley - 1994 - Annals of Pure and Applied Logic 66 (1):27-88.
Systems of explicit mathematics with non-constructive μ-operator. Part I.Solomon Feferman & Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 65 (3):243-263.
Lev D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of pure and applied logic, vol. 85 , pp. 193–242. [REVIEW]Volker Halbach - 2002 - Bulletin of Symbolic Logic 8 (2):302-303.
Model theory of modules.Martin Ziegler - 1984 - Annals of Pure and Applied Logic 26 (2):149-213.
Modal model theory.Maarten De Rijke - forthcoming - Annals of Pure and Applied Logic.

Analytics

Added to PP
2015-08-28

Downloads
32 (#708,450)

6 months
18 (#163,977)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splittings and Disjunctions in Reverse Mathematics.Sam Sanders - 2020 - Notre Dame Journal of Formal Logic 61 (1):51-74.
Representations and the Foundations of Mathematics.Sam Sanders - 2022 - Notre Dame Journal of Formal Logic 63 (1):1-28.
Weak and strong versions of Effective Transfinite Recursion.Patrick Uftring - 2023 - Annals of Pure and Applied Logic 174 (4):103232.

Add more citations

References found in this work

Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.

View all 7 references / Add more references