<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<?xml-stylesheet type="text/xsl" href="../part2stratml.xsl"?><PerformancePlanOrReport><Name>About Logic and Proof</Name><Description>[T]hese are the goals of this course:• You should learn to write clear, “literate,” mathematical proofs.• You should become comfortable with symbolic logic and the formal modeling of deductive proof.• You should learn how to use an interactive proof assistant.• You should understand how to use logic as a precise language for making claims about systems of objects and therelationships between them, and specifying certain states of affairs.</Description><OtherInformation>Let us take a moment to consider the relationship between some of these goals. It is important not to confuse the first three. We are dealing with three kinds of mathematical language: ordinary mathematical language, the symbolic representations of mathematical logic, and computational implementations in interactive proof assistants. These are very different things!Symbolic logic is not meant to replace ordinary mathematical language, and you should not use symbols like ∧ and ∨ in ordinary mathematical proofs any more than you would use them in place of the words “and” and “or” in letters home to your parents. Natural languages provide nuances of expression that can convey levels of meaning and understanding that go beyond pattern matching to verify correctness. At the same time, modeling mathematical language with symbolic expressions provides a level of precision that makes it possible to turn mathematical language itself into an object of study.Each has its place, and we hope to get you to appreciate the value of each without confusing the two.The proof languages used by interactive theorem provers lie somewhere between the two extremes. On the one hand, they have to be specified with enough precision for a computer to process them and act appropriately; on the other hand, they aim to capture some of the higher-level nuances and features of informal language in a way that enables us to write more complex arguments and proofs. Rooted in symbolic logic and designed with ordinary mathematical language in mind, they aim to bridge the gap between the two.</OtherInformation><StrategicPlanCore><Organization><Name>Logic and Proof: Release 0.1</Name><Acronym>L+P</Acronym><Identifier>_48f14ac4-3626-11ea-a8c7-d542fa82ea00</Identifier><Description>Both this online textbook and the Lean theorem prover it invokes are new and ongoing projects, and in places they are still rough. Please bear with us! You can learn more about Lean from its project page and the online textbook, TheoremProving in Lean.</Description><Stakeholder StakeholderTypeType="Person"><Name>Jeremy Avigad</Name><Description>Co-Author</Description></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Robert Y. Lewis</Name><Description>Co-Author</Description></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Floris van Doorn</Name><Description>Co-Author</Description></Stakeholder><Stakeholder StakeholderTypeType="Generic_Group"><Name>Contributors</Name><Description>We are grateful for feedback and corrections from a number of people, including Bruce Cuconato, William DeMeo, Tobias Grosser, Lyle Kopnicky, Alexandre Rademaker, and Matt Rice.</Description></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Bruce Cuconato</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>William DeMeo</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Tobias Grosser</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Lyle Kopnicky</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Alexandre Rademaker</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Matt Rice</Name><Description/></Stakeholder></Organization><Vision><Description/><Identifier>_48f14c04-3626-11ea-a8c7-d542fa82ea00</Identifier></Vision><Mission><Description/><Identifier>_48f14ca4-3626-11ea-a8c7-d542fa82ea00</Identifier></Mission><Value><Name/><Description/></Value><Goal><Name>Mathematical Proofs</Name><Description>Learn to write clear, “literate,” mathematical proofs.</Description><Identifier>_48f14d30-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator>1</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>The first goal of this course is to teach you to write clear, readable mathematical proofs.</OtherInformation><Objective><Name/><Description/><Identifier>_48f14dbc-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator/><Stakeholder><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal><Goal><Name>Symbolic Logic &amp; Deductive Proof</Name><Description>Become comfortable with symbolic logic and the formal modeling of deductive proof.</Description><Identifier>_48f14e3e-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator>2</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>The goal of symbolic logic is to identify [the] core elements of reasoning andargumentation and explain how they work, as well as to explain how more domain-specific notions are introduced and used...The second goal of this course is to help you understand natural deduction, as an example of a formal deductive system.</OtherInformation><Objective><Name/><Description/><Identifier>_48f14ed4-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator/><Stakeholder><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal><Goal><Name>Proof Assistant</Name><Description>Learn how to use an interactive proof assistant.</Description><Identifier>_48f14f60-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator>3</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>A goal of the field of interactive theorem proving is to reach the point where any contemporary theorem can be verified ...The third goal of this course is to teach you to write elementary proofs in Lean.</OtherInformation><Objective><Name/><Description/><Identifier>_48f14fec-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator/><Stakeholder><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal><Goal><Name>Logical Expressions</Name><Description>Understand how to use logic as a precise language for making claims about systems of objects and the relationships between them, and specifying certain states of affairs.</Description><Identifier>_48f15078-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator>4</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>... the goal of symbolic logic is to specify a language and rules of inference thatenable us to get at the truth in a reliable way... The fourth goal of this course is to convey the semantic view of logic, and to lead you to understand how logical expressions can be used to specify states of affairs.</OtherInformation><Objective><Name/><Description/><Identifier>_48f1510e-3626-11ea-a8c7-d542fa82ea00</Identifier><SequenceIndicator/><Stakeholder><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal></StrategicPlanCore><AdministrativeInformation><StartDate>2019-12-19</StartDate><EndDate/><PublicationDate>2020-01-13</PublicationDate><Source>https://leanprover.github.io/logic_and_proof/logic_and_proof.pdf</Source><Submitter><GivenName>Owen</GivenName><Surname>Ambur</Surname><PhoneNumber/><EmailAddress>Owen.Ambur@verizon.net</EmailAddress></Submitter></AdministrativeInformation></PerformancePlanOrReport>
