1998–99 Annual Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:4940738
DOI10.2307/421188zbMath0941.03500OpenAlexW2322056426MaRDI QIDQ4940738
No author found.
Publication date: 12 April 2000
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0503-toc.htm
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Epistemic and intuitionistic formal systems
- Weak density and cupping in the d-r.e. degrees
- Upper bounds for the arithmetical degrees
- A logical framework for default reasoning
- Finitely stratified polymorphism
- Bounded arithmetic and the polynomial hierarchy
- The d.r.e. degrees are not dense
- Computable isomorphisms, degree spectra of relations, and Scott families
- Linear logic as a logic of computations
- Epsilon substitution method for elementary analysis
- The undecidability of the recursively enumerable degrees
- Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
- Strong reducibilities
- Natural 3-valued logics—characterization and proof theory
- The theory of the recursively enumerable weak truth-table degrees is undecidable
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Completions of PA: Models and enumerations of representable sets
- The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
- Systems of predicative analysis
- Computability and Recursion
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: 1998–99 Annual Meeting of the Association for Symbolic Logic
