Hi everyone,
Your midsemester grades, which include the grades for Exam #2, are now posted on the Grades page. Let me know if you have any questions, and send me an email if you have forgotten the password to the Grades page.
Regards,
Prof. Reitz
Month: October 2016 (Page 1 of 2)
Your assignment for the next week is to try to prove the conjecture that your group created in class on Tuesday, 10/14/15. You must spend at least 90 minutes working on this. Trying to prove something can consist of many different activities, such as the following (you do NOT have to do all of these things – you can choose how to spend your time – they are provided for inspiration only).
- coming up with ideas, and testing them out (for example, by creating puzzles and trying to solve them)
- trying to understand what the conjecture says
- trying to solve puzzles that other people created
- trying to create puzzles (and solve them yourself)
- communicating with other members of your group (talking, emailing, etc.)
- trying to write down a proof
- other stuff…
As you work, keep track of what you are doing, thinking, and feeling (this is metacognition – an idea that discussed way back in OpenLab #2). What did you do during the time you spent? Did you create any puzzles? Did you solve puzzles? Did you change your mind about whether the conjecture is true or false? Did you have any new ideas about how to prove the conjecture? Did you have any ideas that you gave up on? How did you feel as you worked – were you frustrated/confused/happy/depressed? Why? Did your mood change along the way?
Assignment (Due Thursday, 11/3/15): Submit a journal of your efforts in the comments below. Your response should be at least 300 words. Describe what you did during the 90 minutes you worked, and express in some way what you were thinking and feeling during the process. Your response can include puzzles (use sketchtoy.com) or other work you did along the way.
Extra Credit. Respond to a fellow student’s comment. Did you do similar things? Different things? Do you have any suggestions for them? Be kind.
GROUP CONJECTURES:
Written work, Due Tuesday, November 1st, in class:
Chapter 8 p145: 3, 7, 18, 19
NOTE: LAST WEEK’S HOMEWORK DEADLINE HAS BEEN EXTENDED TO TUES, NOV 1:
Chapter 6 p.116: 3,4,5,8,9
Chapter 7 p129: 5, 9, 10, 12
WeBWorK – none
OpenLab – OpenLab #6: Proof Journal due next Thursday, November 3rd, in class.
Hi everyone,
I’ve been asked to cover a class for a colleague in the math department today (Tuesday, 10/25), and it overlaps with my office hours. However, I should be able to arrive at our class a few minutes early, and I’ll be able to spend a some time at the start of class answering questions.
Regards,
Prof. Reitz
Hi everyone,
I’ve been enjoying reading your first proof-based homework, and I wanted to give a quick description of how I grade them:
Odd problems are worth 4 points, and are graded (almost exclusively) on completion – did you do the problem? If so, you get 4 points. I will *not* deduct points for minor errors. I *may* deduct points if I notice something really, really wrong. I encourage you to do these problems, and then take a look at the answers in the back of the book – this is a great opportunity to see how proofs should look, feel, and read.
Even problems are worth 8 points. I will be grading these much more carefully, and will be picky about things like using words (not just symbols), giving reasons for each step, and not skipping steps. Your absolute best opportunity to improve your proof-writing may come from looking at what you missed in these problems! If any of my comments are not clear, feel free to ask me about them.
Best,
Prof. Reitz
Written work, Due Thursday, October 27, in class:
Chapter 6 p.116: 3,4,5,8,9
Chapter 7 p129: 5, 9, 10, 12
**NOTE: this assignment is due on Thursday, instead of on Tuesday, because we have our second exam on Tuesday.
WeBWorK – none
OpenLab – none
Hi everyone,
The review sheet for Exam #2, taking place on Tuesday, 10/25, has been posted under Classroom Resources/Exam Reviews. It is unchanged from the previous year. Let me know if you have any questions.
Best,
Prof. Reitz
NOTE: As a component of OpenLab #5, each person should bring to class a conjecture or question about the Bridges and Walking Tours game.
Group Activity (30 min). Get into your groups, arrange your chairs in a circle, and take 30 minutes to:
1. Each person should share their conjecture with the group. For each conjecture, the group should decide if they think it is true or false (or don’t know). The group should record their conclusion for each conjecture.
2. Choose one conjecture (or create a new one) to focus on as a group. Your goal for the next few weeks will be to try to prove or disprove this conjecture. Come up with several ideas about how you might prove it.
Group work due after 30 minutes: Each group will hand in a sheet of paper with the names of the group members, the date, and the following:
– Each member’s conjecture, along with a brief description of what the group thinks – is it true or false?
– Be sure to clearly indicate which of the conjectures the group has chosen to work on – or, if you have created a new conjecture to work on as a group, include that as well.
– Two different ideas about how you might try to prove the chosen conjecture.
Reflection: To be completed individually after group work is complete, and submitted on paper with your names and the date. Take 5 minutes to write on the following prompt:
Briefly reflect on the process of working in a group by responding to each of these points:
1. Describe something you learned.
2. Describe something you contributed to the group.
3. How did today’s work change your understanding of your assigned game?
Hi everyone,
I can’t seem to access my citytech email (or the citytech website), at 9pm on Thursday evening 10/13/16 – so if you’ve sent me questions about the homework, I won’t see them tonight! But I do have access to the OpenLab – if you see this message and have a question, you can go ahead and post it here as a comment, I’ll reply in the same way.
Best,
Prof. Reitz
NOTE: The homework assignment for Chapters 4 & 5 has been modified from the original calendar – it includes two additional problems (and one of the problems is now optional).
Written work, Due Tuesday, October 18th, in class:
Chapter 4 p.100: 1, 6, 7, 15, 16
Chapter 5 p.110: 1, 4, 9, 20*
Odd problems are worth 4 points, even problems worth 8 points.
* (Chapter 5 Problem 20 is optional – solutions will receive extra credit)
WeBWorK – none
OpenLab – none
Exam #2 will take place on Tuesday, 10/25 (first half of class).
Logic on Math StackExchange
- How is $\alpha$-conversion proven in HOL Light? April 26, 2024How is $\alpha$-conversion proven in HOL Light using the primitive rules of inference specified? I believe the theorem to be proved should be something like: $\vdash(\lambda x.P) = (\lambda y.P[y/x])$ where y doesn't occur free in P and P[y/x] is P where x is substituted with y. This is listed as rule ALPHA_CONV in the […]Zeki
- Why does set-theoretic union and intersection operate on reverse logic? April 26, 2024In set theory, $A \cup B$ is logically defined as $\{x : x \in A \lor x \in B\}$. In set theory, the result of unionizing A with B is a bigger set, but in logic, "or" is a softening operation. In set theory, $A \cap B$ is logically defined as $\{x : x \in […]Fomalhaut
- Type theory vs "Theory On Top of Logic" mantra in Set Theories April 25, 2024I have a question about (especially second part of) following statement following statement from wikipedia emphasizing intrinsical feature in which type theory substantially differs from set theories: Unlike set theories, type theories are not built on top of a logic like Frege's. So, each feature of the type theory does double duty as a feature […]user267839
- Explicit geometric machinery to check the truth of FOL formula April 25, 2024It is standard to use the semantics of topological spaces for checking the truth value of propositional formula in the absence of excluded middle. An explicit description is written down here, for example. https://grossack.site/2022/04/17/geometry-and-logic I suppose, there might be possible to have something similar to determine the truth value of first order formulas. i.e. There […]Y.X.
- Why is Gödel's Incompleteness Theorem relevant to anything beyond self-referential statements? April 24, 2024I feel like I understand the general idea behind how Gödel used self-reference to prove that there will always be holes in logical systems, even if you add the self-referential statement to the axioms because you can always create another statement that is true but cannot be proven via Cantor's diagonalization proof. I am confused […]user34140
- Examples of geometric theory without classical models April 24, 2024I encountered a post on locales and geometric theory here https://grossack.site/2022/05/22/locale-basics.html In about the middle of this blog, the author gives a geometric theory defining a function from $\Bbb N$ to $\Bbb R$, and asked: Do you see why this is a nontrivial theory with no classical models? I am not confident that I understand […]Y.X.
- can somone help me finish this fitch proof? [closed] April 24, 2024Premise 1: $P \to Q$ Premise 2: $\lnot P \to R$ Premise 3: $\lnot Q$ Goal: $R.$ $\def\fitch#1#2{\quad\begin{array}{|l}#1\\\hline#2\end{array}} \fitch{~~1.~~P\to Q\\~~2.~~\neg P\to R\\~~3.~~\neg Q}{\fitch{~~4.~~\neg R}{\fitch{~~5.~~P}{~~6.~~Q\hspace{10ex}{\to}\text{Elim }5,1\\~~7.~~\neg Q\hspace{9ex}\text{Reit }3\\~~8.~~\bot\hspace{10ex}\bot\text{Intro }6,7}\\~~9.~~\neg P\hspace{12ex}\neg\text{Intro }6{-}8\\10.~~R\hspace{13ex}{\to}\text{Elim }9,2\\~}\\~}$ the book is Language, Proof and Logic The Second Edition authors are Jon Barwise and John EtchemendyAvrgDude
- Question relating isomorphisms and structures in logic April 24, 2024A question in a sheet was as follows: Let $T_n,$ $n \in\mathbb N \setminus 0,$ be the structure $⟨N; f_n)$ where $f_n(a) = \lfloor\frac{a}{n}\rfloor.$ Draw a picture of Tn for n = 1, 2, 3. For T1 I drew a number-line from 1 to infinity For T2 I drew a number-line of 0, 1, 1, […]Alice
- Derivation of the "Chain syllogism" rule in first order logic April 24, 2024I'm currently reading these: https://www.mcmp.philosophie.uni-muenchen.de/students/math/math_logic_munich.pdf lecture notes and am kind of stuck on the proof on page 58 line 4 where $$\Gamma \lnot \varphi \lnot \varphi$$ is derived using (Ass.). I don't understand how, none of the rule thus far introduced allow me to manipulated the consequent except contradiction which I can't use in this […]Fabio
- Does “false” imply “true”? [duplicate] April 23, 2024I think calling a proposition an "implicature" means something like this: If there is a proposition "p->q" and this proposition is true, then we think that p "implies" q. So if p is false and q is true, does “false” imply “true”? My own thoughts are, Premise: ((I am a cup) and (the cup is […]Display name
Recent Comments