We present the syntax and proof theory of a logic of argumentation, LA
. We also outline the development of a category theoretic semantics fo
r LA. LA is the core of a proof theoretic model for reasoning under un
certainty. In this logic, propositions are labeled with a representati
on of the arguments which support their validity. Arguments may then b
e aggregated to collect more information about the potential validity
of the propositions of interest. We make the notion of aggregation pri
mitive to the logic, and then define strength mappings from sets of ar
guments to one of a number of possible dictionaries. This provides a u
niform framework which incorporates a number of numerical and symbolic
techniques for assigning subjective confidences to propositions on th
e basis of their supporting arguments. These aggregation techniques ar
e also described with examples.