1997–98 Annual Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:4254569
Cites work
- scientific article; zbMATH DE number 192929 (Why is no real title available?)
- scientific article; zbMATH DE number 970828 (Why is no real title available?)
- scientific article; zbMATH DE number 3027246 (Why is no real title available?)
- Constructivity in computer science. Summer symposium, San Antonio, TX, June 19--22, 1991. Proceedings
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- Espaces de Banach stables
- Exponentiation in power series fields
- Generic copies of countable structures
- Necessary uses of abstract set theory in finite mathematics
- On the problem of finding minimal programs for tables
- Partial realizations of Hilbert's program
- Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
- Program size in restricted programming languages
- The topology of elementary submodels
This page was built for publication: 1997–98 Annual Meeting of the Association for Symbolic Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254569)