default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 35
Volume 35, 1987
- Sy D. Friedman:
Strong coding. 1-3 - Sy D. Friedman:
A guide to "strong coding". 99-122 - Radu Diaconescu, Laurence Kirby:
Models of arithmetic and categories with finiteness conditions. 123-148 - Peter J. Freyd:
Choice and well-ordering. 149-166 - Peter J. Freyd, Harvey Friedman, Andre Scedrov
:
Lindenbaum algebras of intuitionistic theories and free categories. 167-172 - John S. Schlipf:
Decidability and definability with circumscription. 173-191 - Sheryl Silibovsky Brady, Jeffrey B. Remmel:
The undecidability of the lattice of R.E. closed subsets of an effective topological space. 193-203 - Berthold J. Maier:
On countable locally described structures. 205-246 - Klaus Weihrauch, Christoph Kreitz:
Representations of the real numbers and of the open subsets of the set of real numbers. 247-260 - A. J. Wilkie, Jeff B. Paris:
On the scheme of induction for bounded arithmetic formulas. 261-302
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.
last updated on 2024-12-27 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
