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
Month: August 2019
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.”
For the past several years I have taught this same course in the Fall semester. At the end of each course, I give my students the following assignment:
Imagine that you are invited to speak on the first day of MAT 2071, to give advice to entering students. Write at least three sentences … describing what you would tell them.
To see the assignment and the students’ responses, follow this link for Fall 2018 and this link for Fall 2017.
Your assignment, due at the beginning of class on Tuesday, September 3th, is to:
- Read through ALL the responses (there are 25 of them altogether).
- Write a reply to this post (1 paragraph) responding to all of the following:
- What advice seemed most relevant to you personally? Why? (you can copy/paste a short statement, or put it in your own words)
- Based on this advice, what changes can you make right now to help you succeed in this course?
Extra Credit. For extra credit, write a response to one of your classmates’ comments. Do you have any advice? Be kind.
Hi everyone,
Your first homework assignment consists of some problems from the book, as well as a WeBWorK assignment – these are due on Tuesday (written work must be handed in in class, WeBWorK must be completed online by the end of the day). Your first OpenLab Assignment is due next Tuesday, September 3 (future OpenLab assignments will generally be due on Thursday – the due date for the first assignment is unusual as Thursday, September 5th, runs on a Monday schedule).
Welcome back,
Prof. Reitz
Week 1 Assignments
Written work due Tuesday September 3th – Sec 1.1 p.7: 1, 12, 19, 26, 29, 35
NOTE: On this assignment, odd problems are worth 2 points and even problems worth 4 points.
WeBWorK – WeBWorK 1, due Tuesday September 3th at midnight
OpenLab – Register for the OpenLab and join this course (instructions provided in a separate post). “OpenLab #1: Advice from the Past” due Tuesday, September 3.
This course is MAT 2071, Introduction to Proofs and Logic, taking place in the Fall 2019 semester with Professor Reitz. We will be using this website in a variety of ways this semester – as a central location for information about the course (assignments, review sheets, policies, and so on), a place to write about the work we are doing, to ask and answer questions, to post examples of our work, and to talk about logic, proofs, mathematics, reality and so on.
Getting Started
Anyone on the internet can look around the site and see what we are doing, and even leave a comment on one of the pages. However, only registered users can create new posts and participate in the discussion boards.
How do I register?
You will need to do two things:
- If you have not used the OpenLab before, you must first create an account. You will need access to your citytech email address for this. Detailed instructions for signing up on the OpenLab can be found here.
- Once you have created an account on the OpenLab, log in and then join this particular course, 2019 Fall – MAT 2071 Proofs and Logic – Reitz. To do this, first click the “Course Profile” link at the top left of this page (just under the picture). Then click the “Join Now” button, which should appear just underneath the picture there.
Problems with the OpenLab or with your CityTech email:
Please let me know if you run into any problems registering or joining our course (send me an email, jreitz@citytech.cuny.edu). I also wanted to give you two resources to help out in the process:
1. For problems with your citytech email account, contact the Student Computing Helpdesk, either in person, by phone, or by email:
Student Computing Helpdesk
Location: Library Building, First Floor (L-114)
Hours: TBD
Phone: 718.260.4900
E-mail: Studenthelpdesk@citytech.cuny.edu
Their website also contains tutorials and FAQ on common problems
2. For problems registering for the OpenLab, contact the OpenLab support team, either by email at openlab@citytech.cuny.edu, or by following this link.
Logic on Math StackExchange
- 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
- Show that Proof by Contradiction rule is derivable from all instances of it with atomic conclusion April 23, 2024The problem shows up in Troelstra's Basic Proof Theory, exercise 2.3.6A. Show that in [classical logic's Natural Deduction], for the languages without ∨, ∃, all instances of ⊥c derivable from instances ⊥c with atomic conclusions. I have a solution to the problem, but I'm not sure if it's correct as it seems trivials, perhaps because […]confusedcius
- Define something based on the property of another set. April 22, 2024I have always been confused about a logic problem, which I can not form it into a general statement. Here is an example that may express my ideas. We know given a set $A$ and an equivalent relation $\sim$ on it. We can define equivalence class by $\forall x\in A, [x]=\{y,|y \sim x\}$. It seems […]Andrew_Ren
- Prove $\forall x \forall y(xEy \rightarrow \neg x=y)$ in the vocabulary of graphs April 22, 2024Problem: Prove the sentence $\forall x \forall y(xEy \rightarrow \neg x=y)$ in the vocabulary of graphs using the axioms of graph theory. So far: The axioms of graph theory given are antireflexivity and symmetry. Here $xEy$ means there's an edge between the vertices $x$ and $y$. We were told we'd need identity axioms for this […]categoricallystupid
- Proving $\exists x P(x) \rightarrow \forall x P(x)$ from $\forall x\forall y(x=y)$ April 22, 2024Problem: Using identity axioms, prove $\exists x P(x) \rightarrow \forall x P(x)$ from $\forall x\forall y \, x=y$. So far: I'm quite stuck on where to even begin. Working backward, I know we want $P(x)$ and $\exists xP(x)$, but I can't quite see how to write it down. I'm used to proof trees over Fitch-style […]categoricallystupid
- Show that $\exists x \forall y R(x,y) \rightarrow \forall x \exists y R(x,y)$ is not provable by natural deduction April 22, 2024Problem: Show that the formula $$\exists x \forall y R(x,y) \rightarrow \forall x \exists y R(x,y)$$ is not provable by natural deduction. So far: First thought that came to mind was simply considering the natural numbers with an order relation to give a counter-example (considering an assignment such that $s(x)=0$). However now $R(x,x)$ is not […]categoricallystupid
- How is the universal generalization rule used? April 22, 2024The following deduction seems correct: $(x+1)^2=x^2+2x+1$ $\forall x (x+1)^2=x^2+2x+1$ But the following deduction is obviously incorrect: $x+1=2$ $\forall x (x+1)=2$ Did I use the universal generalization rule in a wrong way?William
- Automated theorem proving and set theory April 22, 2024I already know a few things about theorem proving however I was wondering how to use this when we are dealing with a non finite amount of axioms. In particular I was hoping to understand how to use automated theorem proving for set theory like ZFC for example. The method I know is using sequent […]Le Grand Spectacle
- How to construct a type $S$ such that for any $f:S, a:A, b:B$, $f(a,b):T(a)[b/y]$? April 22, 2024Convention: when a type depends on a variable from the context, this variable will be omitted from the type. For example, I will write $\Gamma, x:A \vdash B \text{ type}$ as opposed to $\Gamma, x:A \vdash B(x) \text{ type}$. The notation $B(a)$ will be reserved for the cases when $a$ appears in the premise; e.g. […]user837242
Recent Comments