From 7f4790ef28ae6335966de93be23a8be9320d8cde Mon Sep 17 00:00:00 2001
From: Vivien Maisonneuve
Date: Mon, 18 Aug 2014 10:22:03 +0200
Subject: [PATCH] Last-minute changes in the documentation
---
doc/reference.rst | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/doc/reference.rst b/doc/reference.rst
index af5cd4d..4dcfbdc 100644
--- a/doc/reference.rst
+++ b/doc/reference.rst
@@ -230,7 +230,7 @@ They are implemented by the :class:`Rational` class, that inherits from both :cl
Polyhedra
---------
-A *convex polyhedron* (or simply polyhedron) is the space defined by a system of linear equalities and inequalities.
+A *convex polyhedron* (or simply "polyhedron") is the space defined by a system of linear equalities and inequalities.
This space can be unbounded.
.. class:: Polyhedron(equalities, inequalities)
@@ -476,7 +476,7 @@ Unlike polyhedra, domains allow exact computation of union and complementary ope
Comparison and Logic Operators
------------------------------
-The following functions create :class:`Polyhedron` or :class:`Domain` instances by comparison of :class:`LinExpr` instances:
+The following functions create :class:`Polyhedron` or :class:`Domain` instances using the comparisons of two or more :class:`LinExpr` instances:
.. function:: Lt(expr1, expr2[, expr3, ...])
--
2.20.1