default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 32
Volume 32, 1986
- Andreas Blass, Yuri Gurevich:
Henkin quantifiers and complete problems. 1-16 - Rodney G. Downey:
Undecidability of L(F∞) and other lattices of r.e. substructures. 17-26 - Robert C. Flagg:
Integrating classical and intuitionistic type theory. 27-51 - Robert C. Flagg, Harvey M. Friedman:
Epistemic and intuitionistic formal systems. 53-60 - Anand Pillay:
Forking, normalization and canonical bases. 61-81 - Françoise Point:
Quantifier elimination in discriminator varieties. 83-101 - Andre Scedrov
:
Embedding sheaf models for set theory into boolean-valued permutation models with an interior operator. 103-109 - John N. Crossley:
Preface. 111 - Christopher J. Ash:
Stability of recursive structures in arithmetical degrees. 113-135 - Rodney G. Downey, Stuart A. Kurtz:
Recursion theory and ordered groups. 137-151 - Charles McCarty:
Realizability and recursive set theory. 153-183 - Jeffrey B. Remmel:
Graph colorings and recursively bounded Π10-classes. 185-194 - Wilfried Buchholz:
A new system of proof-theoretic ordinal functions. 195-207 - John Cartmell:
Generalised algebraic theories and contextual categories. 209-243 - J. C. E. Dekker:
Isols and burnside's lemma. 245-263 - Yuri Gurevich, Saharon Shelah:
Fixed-point extensions of first-order logic. 265-280 - Philip S. Mulry:
Adjointness in recursion. 281-289 - Andre Scedrov:
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis. 291-297
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-11-11 21:33 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:
