Week 2 Assignments
Written work – none
WeBWorK – Assignment #1 and #2, due Tuesday, September 6th, at midnight.
OpenLab – OpenLab #2, due Thursday, September 8th, at the start of class.
Category: Assignments (Page 3 of 3)
Hi everyone,
Your first homework assignment will be exclusively in the book (you do NOT have a WeBWorK assignment this week), and is due on Tuesday. Your first OpenLab Assignment is due on Thursday.
Welcome back,
Prof. Reitz
Week 1 Assignments
Written work due Tuesday August 30th – 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 – none
OpenLab – Register for the OpenLab and join this course (instructions provided in a separate post). “OpenLab #1: Advice from the Past” due Thurs Sept 1.
A year ago I taught this same course. At the end of the semester, I gave 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.
Your assignment, due at the beginning of class next Thursday, September 1st, is to:
- Read through ALL the responses (there are 19 of them).
- 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.
Logic on Math StackExchange
- Question about the meaning of logical implication May 8, 2024So, I came across the following equivalence: $$(p \to q) \equiv (\neg p \lor q)$$ Which I had been knowing for a while, but I never quite understood. I understand when it's used this way: I assert $p \land (p\to q)$, it follows that $q$. In other words, asserting $p \to q$ is like saying […]Elvis
- At most A does not occur May 8, 2024Let $A$ and $B$ be two events in the sample space $S$. Describe & represent the following event in terms of $A$ and $B$: "at most $A$ does not occur". This is a question that someone asked me, and I think it is meaningless as "at most" makes no sense here. Am I right? Or […]Fermat
- On the limitations(?) of first-order logic in mathematical reasoning May 8, 2024Note: This is a follow-up to this earlier question. Also, for the purpose of this question, I'll use the term "normal mathematics" to refer to topics other than "foundational" ones like logic and set theory. On the one hand, it seems like only a relatively small minority of "normal mathematics" is explicitly written out in […]NikS
- Is there a constructive proof of the 4 axiom in $\sf Grz$? May 7, 2024Willem Blok managed to prove that the 4 axiom of modal logic $\Box \phi \to \Box \Box \phi$ is provable in $K+ \Box (\Box(\phi \to \Box \phi) \to \phi) \to \phi$. Let $\psi=(\phi \land (\Box \phi \to \Box \Box \phi)$. Blok managed to prove 4 by using the theorem of system $K$ $\Box (\phi \to […]PW_246
- What does it mean to "suppose" a proposition in proofs? May 7, 2024I have been putting some thought lately to proofs by contradiction and have the following question. When proving theorems we usually use the word "Suppose P(x)" where P is a proposition, but what do we mean by "suppose"? All propositions are either T or F, and, under some interpretation, their truth value is fixed. Hence, […]Agustin G.
- Why can't we prove CL rule (structural rule) in predicate logic (with quantifiers) [closed] May 7, 2024My professor said that the following rule rule is proven in propositional logic but not in predicate logic? Is there an explanation to that?Alessandra12342
- Proving that Union of finite set with finite elements is finite without Axiom of Choice May 7, 2024How can I without using any form of the axiom of choice, prove that if the set $A$ is finite and all its elements are finite, then the set $\bigcup A$ is also finite? This is the only task that I didn’t do in my homework :( ,so I would really appreciate your help.Maria S.
- if the sequents (Γ ⊢ ψ) and (∆ ⊢ ψ) are both correct, then so is the sequent ((Γ ∩ ∆) ⊢ ψ) May 7, 2024This comes from Chriswell mathematical logic. It is not so clear to me. It's stating that if ψ is provable from assumptions in Γ and also from assumptions in ∆, it is provable from the intersection of the assumptions in Γ and ∆. But since there can be different proofs of a statement it could […]nskywalker
- A seemingly contradictory function - where's the issue? May 7, 2024I have constructed a function of seemingly contradictory nature. Let $f$ be a function which, given an input $n\in \mathbb{N}$, lexicographically searches through all strings and finds the $n$th pair $\langle T, P\rangle$ where $T$ is a valid Turing machine encoding, and $P$ is a valid formal proof (in Peano Arithmetic, for example) that $T$ […]volcanrb
- If $\textbf{x}$ is not free in $\textbf{A}$, show that $\vdash\exists\textbf{x}\textbf{A}\leftrightarrow\textbf{A}$ May 6, 2024Let $A$ be a formula in a theory $T$. Then $\vdash_{T}\exists xA$ certainly shouldn't imply $\vdash_{T}A$ if $x$ is free in $A$, but I don't see what's wrong with the following proof. $\textbf{Lemma}$. If $\vdash_{T}A$ and $\vdash_{T}B$, then $\vdash_{T}A\rightarrow B$. $\textbf{Proof of Lemma}$. Let $T'$ be the theory obtained by adding new constants $e_{1},...,e_{n}$ such […]SihOASHoihd
Recent Comments