NOTE: Next week Tuesday 10/8 there are no classes at City Tech.
Written work – None.
WeBWorK – Assignment #5, due Thursday, October 10th, at midnight.
OpenLab – OpenLab #4, due Thursday, October 10th, before class.
Tag: webwork
Week 5 Assignments
NOTE 1: Exam #1 will take place on Thursday, 9/26 (first half of class).
NOTE 2: Next week Tuesday 10/1 there are no classes at City Tech.
NOTE 3: The following week Tuesday 10/8 there are no classes at City Tech.
Written work – none
WeBWorK – Assignment #4, due Thursday, October 3rd, at midnight. You are encouraged to start working on Assignment #5, which will be due one week later.
OpenLab – OpenLab #4: Bridges and Walking Tours due AT START OF CLASS on Thursday, 10/10.
Week 4 Assignments
UPDATE: WeBWorK Assignment #4 will be due next week, Thursday 10/3.
Written work – none
WeBWorK – Assignment #3 and Assignment #4, due Tuesday, September 24th, at midnight.
OpenLab – none
STUDY – for your first exam, taking place on Thursday, September 26th, during the first hour of class. A review sheet will be posted at least 1 week prior to the exam.
Week 3 Assignments
Written work – Sec 1.8 p.29: 3, 5, 6, 8, due Tuesday, 9/17 (in class)
WeBWorK – Start on WeBWorK 3, (it will not be due until Tuesday, 9/24 at midnight).
OpenLab – OpenLab #3, due Thursday, 9/19 (at start of class).
Hi everyone,
If you’ve had trouble accessing the first WeBWorK assignment, take another look – it should be available now. If you have any trouble, please let me know.
Regards,
Prof. Reitz
WeBWorK is accessible from on and off campus (anywhere you have access to the internet). Your first WeBWorK assignment is due on Tuesday, September 3rd, at midnight, and will cover the material from the second day of class. Here’s what you have to do:
Assignment. To get started , you must complete the following three steps.
Step 1. Log in to WeBWorK here: http://mathww.citytech.cuny.edu/webwork2/MAT2071-F19-Reitz. I have created Usernames and Passwords for each student registered for my class.
Username. Your username for WeBWorK consists of your first initial plus your last name, all lowercase (for example, John Smith would have username ‘jsmith’).
Password. Your password is your Student ID (EmplID in CUNYFirst).
Step 2. Update your email address if you wish. To do this, select “Password/Email” from the main menu on the left. Use whatever email address you like (I suggest using one that you check often).
Step 3. Complete the first assignment, titled Assignment1-Sec1.2-1.3. Click on an assignment on the main screen to get started.
If you have any trouble – either with logging in, or with completing the assignment, post a comment here or send me an email and I will get back to you.
WeBWorK Tips:
- Click on a problem to see the details (the list of problems appears in the menu on the left). Enter an answer and hit “Submit Answers”. Don’t worry, if you get it wrong you can try it again.
- You can work on the problems in any order you wish. You can do some problems now, and come back and do the rest another day (your work will be saved, as long as you submit your answers).
- If you want to print out a copy of the assignment, click on the assignment name in the main menu on the left, and then click the link in the main screen area that reads “Download a hardcopy of this homework set.”
Logic on Math StackExchange
- Can the set of integers be constructed starting from Peano's Axioms without powersets? November 21, 2024I was able to formally construct the set of integers starting from Peano's Axioms using a powerset axiom among other ZF-like axioms (31 lines available here on request). Informally, I have: $\pm 0 = \{(0,~ 0),~ (1,~ 1),~ (2, 2), \cdots \}$ $+1 = \{(1,~ 0),~ (2,~ 1),~ (3, 2), \cdots \}$ $-1 = \{(0,~ […]Dan Christensen
- On the correct $(\forall)$-introduction rule in Natural Deduction November 21, 2024In a nutshell: is the following the $(\forall)$-introduction rule in Natural Deduction? $$\frac{\phi[t/x]}{\forall x\phi}\ \ \ \ \ \ \ \ \ \begin{matrix}\text{provided the term $t$ does not occur in $\phi$}\\ \text{nor in any undischarged assumption in the proof of $\phi[t/x]$}\end{matrix} $$ I began learning about natural deduction from these notes where the $(\forall)$-introduction rule […]Sam
- Proving $\vdash \phi(x,y,\ldots,z)$ if and only if $\vdash\forall x\forall y\cdots\forall z\phi(x,y,\ldots,z)$ using Natural Deduction November 21, 2024I suspect the following holds: $$\vdash \phi(x,y,\ldots,z)\iff \vdash\forall x\forall y\cdots\forall z\phi(x,y,\ldots,z)$$ where $\phi$ is a formula with free variables $x,y,\ldots, z$. Here is my argument using Natural Deduction : $(\Rightarrow):$ $\vdash\phi(x,y,\ldots,z)$ means $\vdash\phi(x',y',\ldots,z')$ for new variables $x',y',\ldots,z'$. Now we may use $\forall$-introduction: $$\frac{\dfrac{\phi(x',y',\ldots,z')}{\forall x\phi(x,y',\ldots,z')}}{\dfrac{\vdots}{\forall x\forall y\cdots\forall z \phi(x,y,\ldots,z)}}$$ $(\Leftarrow):$ using $\forall$-elimination repeatedly: $$\frac{\dfrac{\forall x\forall y\cdots\forall […]Sam
- Is it actually possible to prove difficult propositional theorems without using inference? [closed] November 20, 2024For the theorem $(\phi\to\psi) \to \bigl((\phi\to\xi) \to (\phi\to\psi\land\xi)\bigr),$ I can fairly easily derive any proof using Deduction Theorem, but our professor says that we are allowed to use only the Hilbert/Frege axioms and modus ponens, but not assumptions, conditions, inferences, truth tables or substitutions. Is it actually possible to prove difficult propositional theorems without using […]Whatevur m8
- Why are the ZFC -axioms written like that? [closed] November 20, 2024Question 1: Why is the Axiom of Extensionability written as: $$\forall x \forall y(\forall z(z\in x \iff z\in y) \rightarrow x=y)$$ Doesn't this read: for all $x$ and $y$, $x = y$ if for all $z$, $z$ is a member of $x$ if and only if $z$ is a member of $y$? Isn't this $$\forall […]DefinitelyNotADolphin
- Complete a natural deduction in FOL for this statement: ∃y∀xA(x,y) ⊢ ∀x∃yA(x,y) [closed] November 20, 2024I need help solving this FOL proof. I believe it needs to use change of quantifier rules, but I am having a lot of trouble.Paloma Bushofsky
- Help proving the $(\forall)$-introduction rule written in terms of $\exists$ in natural deduction November 20, 2024I'm trying to prove the $(\forall)$-introduction rule in Natural Deduction (written in terms of $\exists$): $$\frac{\phi [t/x]}{\neg\exists x\neg\phi} \ \ \ \ \begin{matrix}\text{ given that $t$ does not appear in $\phi$ nor in any}\\ \text{ undischarged assumption in the proof of $\phi[t/x]$}\end{matrix}$$ I believe the proof should go something like so: $1.\ \phi[t/x]$ $2.\ \exists […]Sam
- Proof of Deduction Theorem in Hilbert‘s system/calculus November 20, 2024Deduction Theorem: Let $\Sigma$ be an axiom system and $\psi, \varphi$ $L$-formulas. Then the following always holds: $\Sigma, \psi \vdash \varphi \iff \Sigma \vdash \psi \rightarrow \varphi$. “$\Rightarrow$” We prove this direction using mathematical induction on the length of a proof, $n \geq 1$ ($n \in \mathbb{N}$, which justifies the use of math. induction). Base […]Pippen
- Why do we ban renaming of free variables? November 20, 2024I have read this Q&A, but it didn't completely clear up my confusion. It is about substitution and not renaming. I agree with that substitution cannot be allowed freely, because it would allow for situations where the meaning is changed. The same is true for renaming, but just like with substitution, renaming can be allowed […]user110391
- How do you solve the analogy 369 : 329 :: 237 :? [closed] November 20, 2024I came across the following analogy and I’m having trouble identifying the pattern: 369 : 329 :: 237 : ? I’ve noticed that the numbers on the left and right side of the colon appear to be related, and I need help figuring out the logic or pattern that connects them. What I've tried: I […]randomuser
Recent Comments