- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A sharp version of the bounded matijasevich conjecture and the end- extension problem
Journal of Symbolic Logic 57 (2):597-616 (1992)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Bounded-low sets and the high/low hierarchy.Huishan Wu - 2020 - Archive for Mathematical Logic 59 (7-8):925-938.
Rado’s Conjecture and its Baire version.Jing Zhang - 2019 - Journal of Mathematical Logic 20 (1):1950015.
A contribution to the end-extension problem and the Π1 conservativeness problem.Zofia Adamowicz - 1993 - Annals of Pure and Applied Logic 61 (1-2):3-48.
There are no very meager sets in the model in which both the Borel Conjecture and the dual Borel Conjecture are true.Saharon Shelah & Wolfgang Wohofsky - 2016 - Mathematical Logic Quarterly 62 (4-5):434-438.
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.
Bounded Martin's Maximum, Weak [image] Cardinals, and [image].David Asperó & Philip D. Welch - 2002 - Journal of Symbolic Logic 67 (3):1141 - 1152.
Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
Kreisel's Conjecture with minimality principle.Pavel Hrubeš - 2009 - Journal of Symbolic Logic 74 (3):976-988.
On the compositional extension problem.Dag Westerståhl - 2004 - Journal of Philosophical Logic 33 (6):549-582.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
Analytics
Added to PP
2009-01-28
Downloads
45 (#345,268)
6 months
7 (#411,886)
2009-01-28
Downloads
45 (#345,268)
6 months
7 (#411,886)
Historical graph of downloads
Citations of this work
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.
End Extensions of Models of Weak Arithmetic Theories.Costas Dimitracopoulos & Vasileios S. Paschalis - 2016 - Notre Dame Journal of Formal Logic 57 (2):181-193.
A contribution to the end-extension problem and the Π1 conservativeness problem.Zofia Adamowicz - 1993 - Annals of Pure and Applied Logic 61 (1-2):3-48.
A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo