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: Announcements (Page 1 of 2)
Hi everyone,
The grades for Exam #3 are posted under Dashboard / OpenLab Gradebook – the exams will be returned on Tuesday. Let me know if you have any questions.
Regards,
Prof. Reitz
Written work, due Tuesday, December 3rd, in class:
Chapter 10 p167: 1, 2, 5, 10, 15
WeBWorK – none
OpenLab – none
Project – Final Draft of paper due in class on Thursday, 12/5.
Group Presentations on Thursday, 12/5.
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
Hi everyone,
Your Midsemester Grades (including your grades for Exam #2) are posted on the OpenLab Gradebook (Dashboard / OpenLab Gradebook). You will see that your grades for Exam #2 as well as your current Homework, OpenLab, and Project grades have been posted.
Your Midsemester grade is based on the following work completed so far:
Homework 30%, OpenLab 25%, Exams 45%
Midterm grade key:P: passing/satisfactory progress; likely to complete course requirements.U: failing/unsatisfactory progress; not likely to complete course requirements.BL: borderline; barely passing or just below passing; there is a reasonable expectation that the student will pass the courseSA: stopped attending; for students who were attending (at least once) and have now have stopped attending your class.WN grade: Student never attended. Do not assign this grade. This information was based on the “ verification of attendance” (VOA) roster you submitted at the 3rd week of the semester.
Let me know if you have any questions.
Regards,
Prof. Reitz
Written work, Due Thursday, October 17th, in class:
Chapter 4 p.100: 1, 6, 7, 15, 16
Odd problems are worth 4 points, even problems worth 8 points.
WeBWorK – none
OpenLab – OpenLab #5 Due Thursday 10/24. NOTE: Please complete the writing portion on the OpenLab, but bring your Conjecture to class on 10/24 (do not post your Conjecture to the OpenLab)
Hi everyone,
Just a heads up – the fifth WeBWorK assignment is now available, due this Thursday 10/10 at midnight.
Best,
Prof. Reitz
You will have 45 minutes to complete the exam, ending at ___
You may use: pen/pencil. NO: Scratch paper, phones, laptops, tablets, ec.
Please spread out as much as possible in the room.
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
Logic on Math StackExchange
- A property of $\lt$ in Primitive recursive arithmetic July 11, 2024In Primitive recursive arithmetic (PRA), we can introduce $\lt$ by introducing its representing function $K_{\lt}$, where $K_{\lt}(x,y) =sg(x+1-y)$. Here "sg" and "-" are the functions defined by $sg(0)=0\land sg(x+1)=1$, $pred(0)=0\land pred(x+1)=x$ and $a-0=a\land a-(b+1)=pred(a-b)$. In this situation, I want to prove in PRA that if $K_{\lt}(x,y+1)=0$, then $K_{\lt}(x,y)=0\lor x=y$. If $K_{\lt}(x,y+1)=0$, then $sg( (x+1)-(y+1))=sg(pred(x+1-y))=0$. Note […]nilpotent
- First-Order Logic With Extensional Set Membership July 11, 2024It is common to sometimes present First-Order Logic with equality and sometimes without. Adding equality has some nice benefits, including the ability to talk about some number of things, e.g. $\exists x \forall y (A(y) \leftrightarrow y=x)$ is enough to capture “exactly one thing is $A$.” Given that, is there any use to going a […]PW_246
- Paradox in Prisoner's dilemma July 11, 2024I have come across a curious paradox concerning The Prisoner's Dilemma Suppose 4 things : prisoners A and B are rather stupid people and decide to use an artificial intelligence program to decide through a logical proof whether it is better to cooperate or defect. the AI program is deterministic both prisoners use the same […]Arnaud
- in definition of assigment, what's means 'except possibly a'? July 11, 2024in frist-order logic, part of assignments practice represent like this "if 𝜙is ∀𝛼𝜓, where 𝛼 is a variable, then ⊨vℳ 𝜙 iff for every assignment 𝑣' that agrees with 𝑣 on the values of every variable except possibly 𝛼, ⊨v'ℳ'𝜓 " here I don't understand except possibly 𝛼, because I understand 'for all x...' means […]유준상
- Prove: Let α be a proposition containing only Boolean connectives ∧,∨. Then any assignment satisfying α must also satisfy f(α) July 10, 2024The question: Let f be a mapping that takes as input a Boolean proposition (no quantifiers) and outputs the same proposition but with all ∧ symbols replaced by ∨. For example: $$ f(x_1 ∧ (x_2 → ¬x_5) = (x_1 ∨ (x_2 → ¬x_5) $$ Prove: Let α be a proposition containing only Boolean connectives ∧,∨. […]User33975329257439645
- Is this restricted variant of predicate logic decidable, but expressive enough to be encoded by STLC ($\lambda \to$)? July 10, 2024As in the question, is it the case that a predicate calculus with these properties is decidable? n-ary predicates quantifiers finite domain of discourse impredicativity disallowed no function terms If so, is it possible to encode the semantics of this logic in Simply Typed Lambda Calculus ($\lambda\to$)?Vivek Joshy
- If a contrapositive can be shown, then is a direct proof always possible? July 10, 2024If we can prove that $¬Y \implies ¬X,$ then is it always possible to prove that $X \implies Y$ without first proving that $¬Y \implies ¬X$ ? Motivation: when studying analysis, there are some problems/theorems where we must prove $X\implies Y$ and then I try to prove it directly, spend hours stuck without being able […]Red Banana
- Marked numbers on a circle [closed] July 9, 2024On a circle, write all the numbers in ascending order from $1$ to $1000$, clockwise. Starting from $1$, colour in all the numbers in a clockwise direction $k$-th number ($1$, $k + 1$, $2k + 1$, ...). The procedure continues until a number is reached which is already is already coloured. At the end of […]Pálfi Kincső
- Proving "if Q is derivable from P, then all sentential interpretations of P->Q are true" from Suppes criterion I July 9, 2024Question. I have trouble understanding how Patrick Suppes in his "Introduction to logic" derives the important sentence (A2) from another two, (A1) and (CrI). Introduction. He uses criterion I: (Cr1): "Given a set of premises, the rules of logical derivation must permit to infer ONLY those conclusions which logically follow from the premises." He also […]Alex Alex
- Incompleteness Proof Theory and Hypercomputation July 9, 2024Has anyone systematically studied how powerful hypercomputation can overcome "incompleteness proof theory"? For example: A deductive system for second-order logic in standard semantics with soundness and completeness, How powerful hypercomputation can correctly decide whether a given sequence of symbols is a proof or not? A deductive system for Infinitary logic with soundness and Barwise completeness, […]Ember Edison
Recent Comments