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: Resources
Getting Started, How-Tos, and so on
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
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
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.”
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
- Confusion about claim on truth functions (Elliot Mendelson, Introduction to Mathematical Logic) November 8, 2024A truth function of $n$-arguments is defined to be a function of $n$- arguments, the arguments and values of which are the truth values T or F. As we have seen, any statement form containing n distinct statement letters determines a corresponding truth function of n arguments. He then futher elaborates, To be precise, enumerate […]Francis Augustus
- How do I find the number of triplets $(x,y,z) \in (\mathbb{N}^{*})^3$ satisfying the given equation? [closed] November 8, 2024Find $(x,y,z) \in (\mathbb{N}^{*})^3$ such that $\frac{x}{x+1} + \frac{y}{y+1} + \frac{z}{z+1}=2$. I find some triplets like $(2,2,2)$, $(3,3,1)$,$(3,1,3)$,$(1,3,3)$, there are other triplets?Abdelali
- Natural Numbers under Sum Constraints November 8, 2024PROBLEM: Each natural number is coloured blue or red, so if $x$ and $y$ are painted the same colour, then $x+y$ is painted blue (note that it could be $x=y$). Determine all the ways to colour the natural numbers that follow this rule. MY WORK: I thought about what happens if I choose a particular […]Alejandro Lorite
- How do I prove and explain this logical statement using a semantic tree? November 8, 2024Logical statement: $F:$ if $(\neg R)$ then $(\neg P \iff (R \land P))$. I've tried doing it but it seems I am missing a node somewhere, does anyone know where? I am stuck so any help would be appreciated. My Semantic Tree:Reddblue
- Elementary question on recursion theorem November 7, 2024I’m experiencing some confusion regarding definition by recursion, as it’s stated in the attachment below: In particular, if $\left(J,R\right)$ is unambiguous, why is it essential for the function $\operatorname{g_{Q}}$ to be $\left(r + 1\right)$-ary ?. I’d think we can simply define $\operatorname{f}\left(x\right)$ to be $\operatorname{g_{Q}}\left(x\right)$ [rather than $\operatorname{g_Q}\left(x,o_{1}, \ldots,o_{r}\right)$] when $\left(a_{1},\ldots,a_{r}\right)$ are in Q [because […]Cyrus
- How to generically restrict the domain of an axiom? November 7, 2024I need to figure out an elegant and mathematically precise way to restrict the domain of a collection of axioms. Let $N$ and $A$ be arbitrary finite sets, let $\mathcal{P}(A)=\bigl\{P\mid P=(P_i)_{i\in N}:P_i\text{ is a linear order over }A\bigr\}$ be the set of all linear order profiles on $A$, let $F=\{f\mid f:\mathcal{P}(A)\to A\}$ be the set […]EoDmnFOr3q
- Reference Requests: Books or Papers for the Area of Topological Logical Geometrization November 7, 2024Having recently finished reading Topology via Logic, I am captivated by the interplay between logic and topology and eager to explore this field further. I am particularly drawn to what some might refer to as "topological logical geometricization," which, to my understanding, develops analogous methods for addressing problems in differential and algebraic geometry. However, I've […]RanWang
- Help with Recursive Function for Counting Binary Expressions in Logic Assignment November 6, 2024I'm working on a problem for a logic course, and I could really use some help with defining a recursive function. The task is to define countbinexprs, a function that, given a Boolean expression, returns the number of occurrences of binary sub-expressions. The Boolean expressions follow this grammar: BExpr ::= bool | (BExpr ∧ BExpr) […]asfasfasf
- What does {aaa, aab, baa}* equal to? November 6, 2024The answer should be formulated as a property of the lengths of consecutive blocks of identical letters. So, it can't be given using some algorithm or recursive methods. Verification of belonging to the language must be a linear condition. I can easily describe some properties of such words. But how do I come up with […]простой человек
- Let A, B, and C be sets. Show/prove (Not with venn diagram) that (A-B)-C = (A-C) - (B-C) [closed] November 5, 2024I tried to prove this by using logical equivalencies. I attached the picture of my proof. In my proof I stated that (A-B)-C is equal to A and NOT (A and (B or C)) and (A-C) - (B-C) is also equal to A and NOT (A and C) and NOT (B and (B OR C)) […]Samet Cimen
Recent Comments