Hi everyone,

The grades for Exam #3 are posted on the “Grades page – the exams will be returned on Tuesday. Let me know if you have any questions.

Regards,

Prof. Reitz

Skip to the content

Hi everyone,

The grades for Exam #3 are posted on the “Grades page – the exams will be returned on Tuesday. Let me know if you have any questions.

Regards,

Prof. Reitz

Hi everyone,

The review sheet for Exam #3, taking place next Tuesday 11/22, 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

- Mathematical Hierarchies Collapsing at Level 2 May 26, 2024I am looking for (many) examples of mathematical hierarchies like the arithmetical or the polynomial hierarchy that collapse precisely at level 2 (3 is also fine, but the level should be at least 2 and yet relatively low). Some background: The arithmetical hierarchy, for example, is a quantifier alternation depth hierarchy. The formula $$\Xi ~{}={}~ […]blk
- Proving functionally incompleteness by showing $\left \{ \vee \ , \wedge \right \}$ can't be described May 26, 2024The connectives @, $ are defined in the following truth table: $$\begin{matrix} p &q &p@q &p$q \\ F& F& F&T \\ F& T& F&F \\ T& F& T&T \\ T& T& F&T \end{matrix}$$ The question asks if the set of connectives {@, $} is functionally complete. I was able to express negation with the system, […]Daniel
- Translate the sentences into negation May 26, 2024If a person is a teacher,then that person has a college degree. Homar does not have a college degree. The authors were told to submit their manuscripts or be dropped from the list of speakers. The author did not submit their manuscripts. If I am confused or angry, I cannot concentrate. I can concentrate. make […]Agatha Maranan
- I know that double negation of LEM is valid in intuitionistic logic but I need help to understand the following formulation. May 25, 2024For example "Clearly there are operations e->e0, f->f1...".What would be an instance of such operations? And what does it mean the mapping c->h(g) ?nskywalker
- Understanding a proof in propositional logic May 25, 2024I would like help understanding two related claims being made in the following proof, found in the fourth edition of Elliot Mendelson’s introduction to mathematical logic, which I am reading on my own time to help my studies in philosophy of math and philosophical logic. Here is the proof: What I do not understand about […]Joa
- Is there a Gödel sentence for every model? May 25, 2024Gödel’s first incompleteness theorem states that in a formal system of arithmetic there is at least one formula that can be neither proven or disproven within that system. The Gödel sentence is an example of such a unprovable formula. It is (implicitly) about natural numbers where it is (indirectly) true (although unprovable). As the system […]Barney
- How to justify why succession and addition cannot be circularly defined like this? May 24, 2024I am reading Tao's Analysis I, in which he states: One may be tempted to [define the successor of $n$ as] $n + 1$. . . but this would introduce a circularity in our foundations, since the notion of addition will be defined in terms of the successor operation. Say we did define $S(n) = […]Princess Mia
- another werewolf logic problem where werewolves lie and humans tell the truth [closed] May 23, 2024you meet three londoners named Wess, Xandra, and Yuri, each of whom makes a statement. Each of the londoners is either a human or a werewolf. Humans always tell the truth and werewolves always lie. Wess says "There is exactly one werewolf and it is not me" Xandra says "Yeah, Wess is a human" Yuri […]Lynn Wooldridge
- Functions which commute with arbitrary unions May 23, 2024Let $A,B$ be sets and $f: \mathcal{P}(A) \to \mathcal{P}(B)$ be a function. What does it mean to say that such a function "commutes with arbitrary unions"? I read this expression in Exercise 1.1, p.11 of the book "Abstract Algebraic Logic", by Font. I presume it means for that for any $X \in \mathcal{P}(A)$ we have […]user65526
- Necessity of universal quantifier to represent a theorem with logic symbols May 23, 2024I have a preference to reduce the proof steps of a theorem, and the theorem itself, into logic symbols as much as possible. Not just because it is aesthetically appealing, but because it makes makes things simpler and faster when studying, or when one wants to write down any proposition without excess. Since i started […]Davi1399

advice for the future
assignment
assignments
calculus
calendar
cancelled
conjecture
date change
due date
exam #3
exam 1
exam 2
extension
grades
grading criteria
grading policy
graph theory
group paper
group project
homework
in-class
late
lockhart's lament
mathography
metacognition
MIU puzzle
office hours
openlab
OpenLab #4: Bridges and Walking Tours
OpenLab 8
OpenLab8
perfect circle
points
presentation
project
resource
review
rubric
semester project
vi hart
visual math
Wau
webwork
week 8
written work

© 2024 2016 Fall – MAT 2071 Proofs and Logic – Reitz

Theme by Anders Noren — Up ↑

Our goal is to make the OpenLab accessible for all users.

top

Our goal is to make the OpenLab accessible for all users.

## Recent Comments