1997–98 Annual Meeting of the Association for Symbolic Logic

DOI10.2307/420958zbMath0925.03008OpenAlexW2317102747MaRDI QIDQ4254569

No author found.

Publication date: 23 September 1999

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0404-toc.htm

zbMATH Keywords

MeetingLogicSymbolic logicToronto/Canada

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructivity in computer science. Summer symposium, San Antonio, TX, June 19--22, 1991. Proceedings
• Necessary uses of abstract set theory in finite mathematics
• Generic copies of countable structures
• The topology of elementary submodels
• Espaces de Banach stables
• Partial realizations of Hilbert's program
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• Program size in restricted programming languages
• Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
• Exponentiation in power series fields
• On the problem of finding minimal programs for tables

This page was built for publication: 1997–98 Annual Meeting of the Association for Symbolic Logic