- 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
PA( aa )
Notre Dame Journal of Formal Logic 36 (4):560-569 (1995)
Abstract
The theory PA(aa), which is Peano Arithmetic in the context of stationary logic, is shown to be consistent. Moreover, the first-order theory of the class of finitely determinate models of PA(aa) is characterizedLinks
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
Coinductive ℵ0-categorical theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130 - 1137.
An axiomatization for a class of two-cardinal models.James H. Schmerl - 1977 - Journal of Symbolic Logic 42 (2):174-178.
An elementary sentence which has ordered models.James H. Schmerl - 1972 - Journal of Symbolic Logic 37 (3):521-530.
Generalizing special Aronszajn trees.James H. Schmerl - 1974 - Journal of Symbolic Logic 39 (4):732-740.
Partitioning large vector spaces.James H. Schmerl - 2003 - Journal of Symbolic Logic 68 (4):1171-1180.
The isomorphism property for nonstandard universes.James H. Schmerl - 1995 - Journal of Symbolic Logic 60 (2):512-516.
Theories with recursive models.Manuel Lerman & James H. Schmerl - 1979 - Journal of Symbolic Logic 44 (1):59-76.
A reflection principle and its applications to nonstandard models.James H. Schmerl - 1995 - Journal of Symbolic Logic 60 (4):1137-1152.
Large resplendent models generated by indiscernibles.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (4):1382-1388.
On power-like models for hyperinaccessible cardinals.James H. Schmerl & Saharon Shelah - 1972 - Journal of Symbolic Logic 37 (3):531-537.
End extensions of models of arithmetic.James H. Schmerl - 1992 - Notre Dame Journal of Formal Logic 33 (2):216-219.
Recursive Models and the Divisibility Poset.James H. Schmerl - 1998 - Notre Dame Journal of Formal Logic 39 (1):140-148.
Analytics
Added to PP
2010-08-24
Downloads
5 (#1,510,250)
6 months
1 (#1,510,037)
2010-08-24
Downloads
5 (#1,510,250)
6 months
1 (#1,510,037)
Historical graph of downloads
References found in this work
Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
On the role of Ramsey quantifiers in first order arithmetic.James H. Schmerl & Stephen G. Simpson - 1982 - Journal of Symbolic Logic 47 (2):423-435.
A correction to “stationary logic”.Jon Barwise, Matt Kaufmann & Michael Makkai - 1981 - Annals of Mathematical Logic 20 (2):231-232.
Set theory with a Filter quantifier.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (2):263-287.
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-hc2g5 uwo