- 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
Game sentences, recursive saturation and definability
Journal of Symbolic Logic 45 (1):35-46 (1980)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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
A Valuation Theoretic Characterization of Recursively Saturated Real Closed Fields.Paola D’Aquino, Salma Kuhlmann & Karen Lange - 2015 - Journal of Symbolic Logic 80 (1):194-206.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
Definability and automorphisms in abstract logics.Xavier Caicedo - 2004 - Archive for Mathematical Logic 43 (8):937-945.
The Nonarithmeticity of the Predicate Logic of Strictly Primitive Recursive Realizability.Valery Plisko - forthcoming - Review of Symbolic Logic:1-30.
Akiko Kino. On definability of ordinals in logic with infinitely long expressions. The journal of symbolic logic, vol. 31 , pp. 365–375. - Akiko Kino. Correction to a paper on definability of ordinals in infinite logic. The journal of symbolic logic, vol. 32 , pp. 343–344.Carol Karp - 1970 - Journal of Symbolic Logic 35 (2):341.
Analytics
Added to PP
2009-01-28
Downloads
43 (#524,466)
6 months
18 (#167,512)
2009-01-28
Downloads
43 (#524,466)
6 months
18 (#167,512)
Historical graph of downloads
References found in this work
Models with compactness properties relative to an admissible language.J. P. Ressayre - 1977 - Annals of Mathematical Logic 11 (1):31.
Generalized interpolation and definability.David W. Kueker - 1970 - Annals of Mathematical Logic 1 (4):423.
An admissible generalization of a theorem on countable ¹ 1 sets of reals with applications.M. Makkai - 1977 - Annals of Mathematical Logic 11 (1):1.
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-667477cd97-7qg25 dc2