Some applications of forcing to hierarchy problems in arithmetic

Mathematical Logic Quarterly 15 (20-22):341-352 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19690152004

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

Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.
Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
Approximate counting by hashing in bounded arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
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.
Poincare on Mathematics, Intuition and the Foundations of Science.Janet Folina - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:217 - 226.
An Analysis of the W -Hierarchy.Yijia Chen, Jörg Flum & Martin Grohe - 2007 - Journal of Symbolic Logic 72 (2):513 - 534.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.Neil Thapen - 2011 - Archive for Mathematical Logic 50 (7):665-680.
Relating the bounded arithmetic and polynomial time hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
On Genericity and Ershov's Hierarchy.Amy Gale & Rod Downey - 2001 - Mathematical Logic Quarterly 47 (2):161-182.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
Multifunction algebras and the provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.

Analytics

Added to PP
2016-02-04

Downloads
36 (#434,037)

6 months
4 (#800,606)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Notions of weak genericity.Stuart A. Kurtz - 1983 - Journal of Symbolic Logic 48 (3):764-770.
Complexity of the -query Tautologies in the Presence of a Generic Oracle.Toshio Suzuki - 2000 - Notre Dame Journal of Formal Logic 41 (2):142-151.

View all 12 citations / Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
General Topology.John L. Kelley - 1962 - Journal of Symbolic Logic 27 (2):235-235.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.

Add more references