A few notes on the Borda and Condorcet methods

The present Technical Report contains a short analysis of both the Borda and the Condorcet methods. We start with a description of both methods in their twofold roles:
of methods for defining a winning alternative from a set of available alternatives,}
of possible outranking methods over a set of alternatives.
We then discuss the properties of each method and analyze them with regard to the conditions posed by the Arrow's impossibility theorem.
The last step, that represents the core part of the Technical Report, is represented by the search of possible relations between the two methods.
The Technical Report closes with the proposal of a composed outranking method based on both the Borda and the Condorcet methods executed on the same profiles of preferences.
As usual, reports of errors and inaccuracies are gratefully appreciated.