![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Annals of Pure and Applied Logic, Volume 25
Volume 25, Number 1, October 1983
- Arthur W. Apter:
Some results on consecutive large cardinals. 1-17 - Hans Georg Carstens, Peter Päppinghaus:
Recursive coloration of countable graphs. 19-45 - David R. Guichard:
Automorphisms of substructure lattices in recursive algebra. 47-58 - James M. Henle:
Magidor-like and radin-like forcing. 59-72 - Roger D. Maddux
:
A sequent calculus for relation algebras. 73-101
Volume 25, Number 2, November 1983
- Stewart Baldwin:
Generalizing the Mahlo Hierarchy, with Applications to the Mitchell Models. 103-127 - Harvey M. Friedman, Andrej Scedrov
:
Set existence property for intuitionistic theories with dependent choice. 129-140 - Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith:
Countable algebra and set existence axioms. 141-181 - Saharon Shelah
:
Models with second order properties IV. A general method and eliminating diamonds. 183-212
Volume 25, Number 3, December 1983
- Gregory L. Cherlin, Max A. Dickmann:
Real closed rings II. model theory. 213-231 - Hans-Dieter Donder, Peter Koepke:
On the consistency strength of 'Accessible' Jonsson Cardinals and of the Weak Chang Conjecture. 233-261 - Johann A. Makowsky, Saharon Shelah
:
Positive results in abstract model theory: a theory of compact logics. 263-299 - Heikki Mannila:
A topological characterization of (λ, μ)*-compactness. 301-305
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.