default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 95
Volume 95, Number 1-3, 5 November 1998
- Rodney G. Downey, Geoffrey LaForte, André Nies
:
Computably Enumerable Sets and Quasi-Reducibility. 1-35 - Benjamin Schaeffer:
Dynamic Notions of Genericity and Array Noncomputability. 37-69 - Zoé Chatzidakis, Anand Pillay:
Generic Structures and Simple Theories. 71-92 - Toshiyasu Arai:
Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection. 93-184 - Steve Maxwell:
A General Model Completeness Result for Expansions of the Real Ordered Field. 185-227 - Melinda Lombard, Richard Vesley:
A Common Axiom Set for Classical and Intuitionistic Plane Geometry. 229-255 - Ulrich Kohlenbach:
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness. 257-285
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 2025-01-13 01:09 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:
