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
- How does one construct the deductive theory of statements? April 27, 2025How does one construct the deductive theory of statements? By "the deductive theory of statements," I mean a formal theory containing all the truths about statements that we learned in propositional logic, such as the law of non-contradiction, the law of excluded middle, the law that every statement implies itself and so on. My guess […]logiclearner
- a property between compactness and non-compactness in logic April 27, 2025Background and motivation: Without specifying exactly what "a logic" is (since any one definition would be unnecessarily restrictive for the purposes of this question), we can say that a logic is compact if it satisfies the analogue of the compactness theorem for FOL, that is, if a set of sentences is finitely satisfiable, then the […]Carlyle
- Are $1$, $2$, $3$... the only definable natural numbers? April 27, 2025Of course $1$, $2$, $3$... etc have defining axioms. If we're working with an $\omega$-inconsistent theory we can also have a natural number $m$ satisfying $\neg P(m)$ even though $P(1)$, $P(2)$, $P(3)$... etc are all provable. But we don't have uniqueness, so we can't add a defining axiom. Can there ever be a definable natural […]Pineapple Fish
- Is quantum mechanics complete -mathematically - [closed] April 26, 2025I have a question If we consider gödel's incompleteness theorems, then quantum mechanics mathematical formalism isn't coherent nor complete, then why did the Copenhagen interpretation scientists say that the mathematical foundation of quantum mechanics is no subject of objection ? "Nous tenons la mécanique des quanta pour une théorie complète, dont les hypothèses fondamentales, physiques […]Mohammed ramy Cherif
- In Velleman’s How to Prove It Example 1.1.2 (1), should “Either John went to the store, or we’re out of eggs” be modelled using exclusive OR? [duplicate] April 26, 2025I’m working through Daniel Velleman’s textbook How to Prove It: A Structured Approach (second edition). In Example 1.1.2 (1). The book analyses the statement: Either John went to the store, or we’re out of eggs. It models this as: $$P \lor Q$$ where: P = “John went to the store” Q = “We’re out of […]georgeamccarthy
- Does this Weird Correspondence of $\Box$ to $\top \to$ to the S4 Axioms Allow for a Companion to IS4 with No Modal Operators? April 26, 2025This just struck me as weird while I was reading a bunch of papers on modal decision procedures for intuitionistic propositional logic: N : If $A$ is a theorem, derive $\Box A$. ~ If $A$ is a theorem, derive $\top \to A$. K : $\Box (A \to B) \to (\Box A \to \Box B)$ ~ […]Joshua Harwood
- Help walking through difficulties understanding the difference between $\forall x$ and infinite conjunction April 26, 2025I (and possibly others) naively thought of $\forall$ as an infinite conjunction (only vaguely aware of others saying to avoid this interpretation of the $\forall$ sign). Years later I'm confronting this belief. I've read over Derek Elkins' blog post on the matter. I only partially probably have the logical prerequisites to approach the problem, but […]Pineapple Fish
- Does $p,q ∈ S$ require $p$ and $q$ to be distinct? Name binding in mathematics. [closed] April 25, 2025I have noticed that different authors use different rules for such simple statements such as "Let there be two numbers $p$ and $q$." Most allow the possibility that $p$ and $q$ are the same number. Others treat $p$ and $q$ as necessarily distinct; for example, Stephenson in An Introduction to Matrices, Sets and Groups specifically […]Steven Thomas Hatton
- Ordering the set of all filters on a partial order. April 25, 2025Fix two partial orders, $R$ and $R'$, on the same set $X$. Denote by $F(R)$ and $F(R')$ the set of all filters of $R$ and $R'$ respectively. Specifically, for $f \subseteq X$ we have $f \in F(R)$ if $f$ is non-empty $x \in f$ and $xRy$ implies $y \in f$ $x,y \in f$ implies there […]201p
- Explanation of a fallacy during Structural Induction [closed] April 25, 2025Here is the description of Structural Induction extracted from "Discrete Mathematics and Its Applications - 8th edition" by Kenneth Rosen: BASIS STEP: Show that the result holds for all elements specified in the basis step of the recursive definition to be in the set. RECURSIVE STEP: Show that if the statement is true for each […]Vlad Mikheenko
Recent Comments