Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Paris, L. Kirby (1978)
∑n-Collection Schemas in ArithmeticStudies in logic and the foundations of mathematics, 96
J. Paris (1981)
Model theory and arithmetic
P. Clote (1985)
Proc. 6th Latin American Symposium Caracas, Venezuela
J. Paris (1981)
Some conservation results for fragments of arithmetic
L. Kirby, J. Paris (1977)
Initial segments of models of Peano's axioms
L. Kirby, K. McAllon, R. Murawski (1981)
Indicators, recursive saturation and expandabilityFundamenta Mathematicae, 114
R. Kossak (1990)
On extensions of models of strong fragments of arithmetic, 108
P. Clote (1985)
Partition relations in arithmetic
A. Wilkie, J. Paris (1989)
On the Existence of end Extensions of Models of Bounded InductionStudies in logic and the foundations of mathematics, 126
A. Lachlan, M. Srebrny, A. Zarach (1977)
Set Theory and Hierarchy Theory V
We define certain properties of subsets of models of arithmetic related to their codability in end extensions and elementary end extensions. We characterize these properties using some more familiar notions concerning cuts in models of arithmetic.
Archive for Mathematical Logic – Springer Journals
Published: Feb 21, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.