UGA Genealogy Pro Talk Webinar
Tuesday, July 2
"Defining 'Reasonably Exhaustive' Considering Limitations on Time and Money"
6:00 pm to 7:00 pm MDT
Presented by Paul K. Graham, AG, CG, CGL
Register Now FREE and OPEN to the Public.
It’s the first element of the Genealogical Proof Standard, and it’s central to determining whether we’ve established proof of our research claims. But what does “reasonably exhaustive research” mean in the context of client work? How do we meet the standard given professional constraints? We’ll dig into these questions and learn strategies to give us a better chance of meeting the standard within financial and time limitations.
Paul K. Graham, AG, CG, CGL, is a Senior Genealogist at AncestryProGenealogists, where he conducts research for clients and for the television show Who Do You Think You Are?. He specializes in genealogical problem solving across the English-speaking world. Paul is BCG-certified and an ICAPGen Accredited Genealogist professional, and he holds a master’s degree in public history and a professional certificate in geographic information systems. Starting in January, he will begin coordinating the Advanced Genealogical Methods course at the Salt Lake Institute of Genealogy.
Paul has authored or co-authored numerous books and articles, including Georgia Courthouse Disasters and Georgia Land Lottery Research. His publications have earned him the National Genealogical Society (NGS) Award for Excellence and the American Society of Genealogists (ASG) Scholar Award, and he is a winner of the NGS Family History Writing Contest. Paul grew up in North Carolina and Georgia and currently resides in Logan, Utah.
The syllabus will be available to attendees and UGA Members the day of the presentation.
This blog and related calendar are shuttering effective 1 Jan 2022 in favor of ConferenceKeeper.org
Sunday, June 30, 2019
UGA Genealogy Pro Talk: "Defining Reasonably Exhaustive Search, Considering Limitations on Time and Money," by Paul K. Graham, AG, CG, CGL
Subscribe to: Post Comments (Atom)
Post a Comment