Hi everyone,
The review sheet for the final exam has been posted under Classroom Resources / Exam Reviews. As always, let me know in person, by email, or here on the OpenLab if you have any questions.
Regards,
Prof. Reitz
Category: Announcements (Page 1 of 2)
Hi everyone,
The grades for Exam #3 are posted under Dashboard / OpenLab Gradebook – the exams will be returned on Tuesday. Let me know if you have any questions.
Regards,
Prof. Reitz
Written work, due Tuesday, December 3rd, in class:
Chapter 10 p167: 1, 2, 5, 10, 15
WeBWorK – none
OpenLab – none
Project – Final Draft of paper due in class on Thursday, 12/5.
Group Presentations on Thursday, 12/5.
Hi everyone,
The review sheet for Exam #3, taking place on Tuesday 11/26, is posted under Classroom Resources / Exam Reviews. As always, if you have any questions or notice any errors please let me know (by email, in person, or here on the OpenLab).
Best,
Prof. Reitz
Hi everyone,
Your Midsemester Grades (including your grades for Exam #2) are posted on the OpenLab Gradebook (Dashboard / OpenLab Gradebook). You will see that your grades for Exam #2 as well as your current Homework, OpenLab, and Project grades have been posted.
Your Midsemester grade is based on the following work completed so far:
Homework 30%, OpenLab 25%, Exams 45%
Midterm grade key:P: passing/satisfactory progress; likely to complete course requirements.U: failing/unsatisfactory progress; not likely to complete course requirements.BL: borderline; barely passing or just below passing; there is a reasonable expectation that the student will pass the courseSA: stopped attending; for students who were attending (at least once) and have now have stopped attending your class.WN grade: Student never attended. Do not assign this grade. This information was based on the “ verification of attendance” (VOA) roster you submitted at the 3rd week of the semester.
Let me know if you have any questions.
Regards,
Prof. Reitz
Written work, Due Thursday, October 17th, in class:
Chapter 4 p.100: 1, 6, 7, 15, 16
Odd problems are worth 4 points, even problems worth 8 points.
WeBWorK – none
OpenLab – OpenLab #5 Due Thursday 10/24. NOTE: Please complete the writing portion on the OpenLab, but bring your Conjecture to class on 10/24 (do not post your Conjecture to the OpenLab)
Hi everyone,
Just a heads up – the fifth WeBWorK assignment is now available, due this Thursday 10/10 at midnight.
Best,
Prof. Reitz
You will have 45 minutes to complete the exam, ending at ___
You may use: pen/pencil. NO: Scratch paper, phones, laptops, tablets, ec.
Please spread out as much as possible in the room.
The first exam will take place on Thursday, September 26. The review sheet is posted under “Classroom Resources/Exam Reviews” – it is the same as last year’s Exam #1 Review. Please let me know if you have any questions, or to report an error.
Regards,
Prof. Reitz
Logic on Math StackExchange
- Does proof by contradiction construct a vacuously true statement? October 14, 2024When you are proving something using proof by contradiction, are you actually constructing a vacuously true statement? Let's say that you want to prove $P$ via proof by contradiction. First, you assume that $\lnot P$ is true. Then via direct proof, you show that $\lnot P \Longrightarrow \bot$. Therefore, $P.$ And, the only way for […]fgh
- In the positive fragment of Naive Set Theory, does $\{x:x\in x\}$ belong to itself? October 14, 2024The Naive Set Theory ($\mathsf{NST}$) is an inconsistent, trivial theory, but its positive fragment was shown to be consistent and is basis of e.g. positive set theory $\mathsf{GPK}_{\infty}^{+}$ of Olivier Esser. In the positive fragment, instances of unrestricted comprehension are restricted to only positive formulas (the smallest class of formulas containing atomic membership and equality […]Timotej Šujan
- Confusion with the proof for the Halting Problem October 14, 2024I was considering the halting problem, and I'm confused about why it is impossible. As I understand it, the problem is defined as follows. There exists a program $h(x,i)$ which takes as input a program $x$ and an input to that program $i$ and then reports if the program $x$ reaches a final decision on […]Emizaquel
- What if someone proves Self referencal paradox in general [closed] October 13, 2024Good greetings I have a question that might seems stupid to one yet Is it possible to find a general solution for self referencal paradox??? Like for say a general algorithm that can help to find out the way to solve any/almost all self referencal paradox I would be incredibly grateful if one could provide […]Avantika Vats
- Is it true that there are real numbers that cannot be expressed? October 13, 2024This might be elementary (or obviously wrong) for mathematicians. I am an engineer. Since we write numbers using finite strings of symbols (not necessarily digits - even formulas are finite strings of symbols) does that mean that there are a lot more real numbers which cannot be written in any way, than there are real […]Censored to protect the guilty
- What exactly is (should be) a “structure” for $L_2$ (language of 2nd-order arithmetic)? October 13, 2024From Simpson’s Subsystems of Second Order Arithmetic: The language of second order arithmetic is a two-sorted language…Variables of the first sort are known as number variables…Variables of the second sort are known as set variables…Atomic formulas are $t_1 = t_2$, $t_1 < t_2$, and $t_1 \in X$ where $t_1$ and $t_2$ are numerical terms and […]NikS
- Prove: Neighbourhood of Spanning Tree is exact October 12, 2024In my lecture the neighbourhood of a spanning tree f is defined as: N(f) = {g element of F | g can be obtained from f as follows: Add an edge to the tree f, producing a cycle, then delete any edge from the cycle}. Where F is the set of feasible solutions. In the […]Franka
- $∀xP(x)∧Z(x) \equiv ∀x(P(x)∧Z(x))\,?$ [closed] October 11, 2024Without more parentheses, I don't know the scope of the universal quantifier in $$∀x P(x)∧Z(x).$$ Does it apply to both $P$ and $Z:$ $∀x(P(x)∧Z(x))$ ?Bob School
- Trying to proof two XOR instances [closed] October 11, 2024I have proof (truth table) that both instances of XOR are correct. Which means both instances have to be equal to each other. Yet, I am missing the insight to get from one to the other. My (math) background is rather modest but I would be pleased if someone could help me apply the laws […]fabio-dc
- How to logically formalize two-player with imperfect information? October 11, 2024It is known that any first-order formula with no free variables is equivalent to a perfect information game with finitely-many turns, that is, for example, the formula $\forall x, \exists y, x\neq y$ describes the game « Alice plays $x$ first, and then, Bob, knowing that Alice played $x$, plays $y$, and then the referee […]Plop
Recent Comments