From: Stefano Zacchiroli <zack@upsilon.cc>
Date: Sat, 10 Jun 2006 16:21:25 +0000 (+0000)
Subject: consistent naming of the calculus
X-Git-Tag: 0.4.95@7852~1345
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=68a48cdf1ef091660a6cbd8293e6cc8fa21435f0;p=helm.git

consistent naming of the calculus
---

diff --git a/matita/help/C/sec_gettingstarted.xml b/matita/help/C/sec_gettingstarted.xml
index 27e373295..b067e21ec 100644
--- a/matita/help/C/sec_gettingstarted.xml
+++ b/matita/help/C/sec_gettingstarted.xml
@@ -3,7 +3,7 @@
 
 <chapter id="sec_gettingstarted">
   <title>Getting started</title>
-  <para> If you are already familiar with the Calculus of (co)Inductive
+  <para> If you are already familiar with the Calculus of (Co)Inductive
   Constructions (CIC) and with interactive theorem provers with procedural
   proof languages (expecially Coq), getting started with Matita is relatively
   easy. You just need to learn how to type Unicode symbols, how to browse
diff --git a/matita/help/C/sec_intro.xml b/matita/help/C/sec_intro.xml
index 773bda24c..6c22f4664 100644
--- a/matita/help/C/sec_intro.xml
+++ b/matita/help/C/sec_intro.xml
@@ -9,7 +9,7 @@
       (or proof assistant) with the following characteristics:</para>
     <itemizedlist>
       <listitem>
-        <para>It is based on a variant of the Calculus of (co)Inductive Constructions (CIC). CIC is also the logic of the Coq proof assistant.</para>
+        <para>It is based on a variant of the Calculus of (Co)Inductive Constructions (CIC). CIC is also the logic of the Coq proof assistant.</para>
       </listitem>
       <listitem>
         <para>It adopts a procedural proof language, but it has a new set of small step tacticals that improve proof structuring and debugging.</para>