Basu, S., Pollack, R., & Roy, M. F. (1996). On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43, 1002–1045.
Brown, C. (2001a). Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation, 32, 447–465.
Brown, C. (2001b). Simple CAD construction and its applications. Journal of Symbolic Computation, 31, 521–547.
Caviness, B., & Johnson, J., editors. (1998). Quantifier Elimination and Cylindrical Algebraic Decomposition. Vienna: Springer-Verlag.
Collins, G. (1975). Quantifier elimination for real closed fields by cylindrical algebraic decomposition. , pp. 85–121.
Davenport, J. H., & Heintz, J. (1988). Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5, 29–35.
Feferman, A. B., & Feferman, S. (2004). Alfred Tarski: Life and Logic. Cambridge: Cambridge University Press.
Feller, W. (1968). An Introduction to Probability Theory and Its Applications (third edition), vol. 1. New York: John Wiley & Sons Inc.
Fitelson, B. (1999). The plurality of Bayesian measures of confirmation and the problem of measure sensitivity. Philosophy of Science, 66, S362–S378. Available online from: http://fitelson.org/psa.pdf. Fitelson, B. (2001a). A Bayesian account of independent evidence with applications. Philosophy of Science, 68, S123–S140. Available online from: http://fitelson.org/psa2.pdf. Fitelson, B. (2001b). Studies in Bayesian confirmation theory. , University of Wisconsin – Madison (Philosophy). Available online from: http://fitelson.org/thesis.pdf. Fitelson, B., & Hawthorne, J. (to appear). How Bayesian confirmation theory handles the paradox of the ravens. In Eells, E., & Fetzer, J., editors, Probability in Science. Open Court. Available online from: http://fitelson.org/ravens.pdf.
Hong, H. (1990). An improvement of the projection operator in cylindrical algebraic decomposition. , pp. 166–173.
Hong, H. (1992). Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. In Wang, P., editor (1992). ISSAC ’92: Papers from the International Symposium on Symbolic and Algebraic Computation. New York: Association for Computing Machinery, pp. 177–188.
Huntington, G. (to appear). Decision procedures for the pure existential fragment of the theory of real-closed fields. , Group in Logic and the Methodology of Science, UC – Berkeley.
Kolmogorov, A. (1956). Foundations of Probability (second edition). New York: AMS Chelsea.
McCallum, S. (1998). An improved projection operator for cylindrical algebraic decomposition. , pp. 242–268.
Paris, J. (1995). The Uncertain Reasoner's Companion: A Mathematical Perspective. Cambridge: Cambridge University Press.
Strzebonski, A. (2000a). Solving algebraic inequalities with version 4. The Mathematica Journal, 7, 525–541.
Strzebonski, A. (2000b). Solving systems of strict polynomial inequalities. Journal of Symbolic Computation, 29, 471–480.
Tarski, A. (1951). A Decision Method for Elementary Algebra and Geometry. Berkeley, CA: University of California Press.
Wolfram, S. (2003). The Mathematica Book, Version 5. Cambridge: Wolfram Research.