Skip to content

Commit a27deee

Browse files
author
Trequetrum
committed
Update Text
1 parent fac4cd9 commit a27deee

File tree

2 files changed

+6
-2
lines changed

2 files changed

+6
-2
lines changed

Game.lean

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@ Title "A Lean Intro to Logic"
3838
Introduction
3939
"
4040
# An Introduction to Constructive Logic
41-
This is a game about evidence and propositions.
41+
This is a game about evidence [¹] and propositions.
4242
4343
To play this puzzler you'll need to learn some notation. Unlike learning how to do a crossword or solve a Sudoku, the notation is a bit more involved. As the levels progress, you will — in effect — be learning a small part of a programming language. Just enough to prove (or construct evidence for) propositions and predicates.
4444
@@ -133,6 +133,8 @@ Click on the first world — **Party Invites** — to get started.
133133
134134
----
135135
136+
[¹] This game says “evidence” where other learning material may say “term”, “proof”, or neither (relying on context to differentate a proposition from it's proof). I use *evidence* for this game in an effort to make the flavor text seem less at odds with the formalization.\\
137+
\\
136138
[ˢʳᶜ]Logic example taken from [IEP](https://iep.utm.edu/propositional-logic-sentential-logic/#H5) entry: *Propositional Logic*.
137139
"
138140

Game/Levels/IffIntro/L07.lean

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,9 @@ OnlyTactic
1212

1313
Introduction "
1414
# BOSS LEVEL
15-
This is an involved level. It doesn't require you to do anything tricky, but there are a lot of moving parts and it is easy to lose track of what you're doing.
15+
This is an involved level. It doesn't require you to do anything tricky, but there are a lot of moving parts and it is easy to lose track of what you're doing.\\
16+
\\
17+
I recommend editor mode. Think about what this is asking you to prove and use `have` to give yourself any auxillary facts that don't exist under your theorems.
1618
"
1719

1820
Statement (P Q R : Prop): (P ∧ Q ↔ R ∧ Q) ↔ Q → (P ↔ R) := by

0 commit comments

Comments
 (0)