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 Thursday 11/16, 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

- How do you prove the theorems in Gödel's ontological proof? May 29, 2024I will be referencing the proof that can be found here: Gödel's ontological proof - Wikipedia In Gödel's ontological proof there are axioms and definitions, which of course do not need to be proven; however, four theorems are stated, and I could not find proof for any of them by searching the internet. I was […]Elvis
- Why is exclusive disjunction not a standard logical operation? May 29, 2024This question Rules of inference for exclusive disjunction and logical biconditional shows that the inference rule for exclusive disjunction are little different from the other rules for conjunction, disjunction, implication, etc. Then why is the exclusive disjunction so often neglected/left out? I know it can be defined a posteriori without having it as a primary […]richardIII
- Choosing between the 'and' and 'implies' connectives May 29, 2024$pol(x): x$ is a politician $liar(x): x $ is a liar All politicians are liars : $\forall x(pol(x) → liar(x))$ Some politicians are liars : $\exists x(pol(x) \land liar(x))$ No politicians are liars : $\forall x(pol(x) → ¬liar(x))$ Some politicians are not liars : $\exists x(pol(x) \land ¬liar(x))$ So, do we just use 'and' for […]user1327299
- Formalities on loop invariant - algorithms May 28, 2024When proving an algorithm using a loop invariant, we need to check these three things. The loop invariant holds before the loop is entered (initialization) If the loop invariant holds before the loop is entered then the loop invariant holds before entering the next iteration of the loop (maintenance) The loop is finite We can […]Agustin G.
- I literally cannot understand the logic in tableaux, can someone guide me to really understand what I have to do here? [closed] May 28, 2024(¬H)∨H,H→H,H↔H,H↔(H∧H),H↔(H∨H),H↔(H∧(H∨G)),H↔(H∨(H∧G))Guilherme Mourão
- Is it possible to invoke the empty function? May 28, 2024The empty function $f: \emptyset \rightarrow X$ is a function from the empty set to an arbitrary set $X$. Since $\emptyset$ is the only subset of $\emptyset \times X = \emptyset$, $f$ must be equal to $\emptyset$. Is it possible to invoke the empty function? To clarify what I mean, consider a function $g: \{ […]Vlad Mikheenko
- How to prove that two algebraically closed field with same characteristic and cardinal are isomorphic? [duplicate] May 28, 2024Hi I would like to prove that for algebraic closed field $F_1,F_2$ if: They have the same characteristic $p$ They have the same cardinal and is uncountable Then they are isomorphic. I have proved that with the same characteristic $F_1,F_2$ has isomorphic sub-field, donate $F'$, and $F_1,F_2$ are vector space over $F'$ I think the […]Shore
- How to prove expended fields whose base has same cardinal are isomorphic? May 27, 2024I would like to prove that for field $F_1,F_2$ if they : have isomorphic sub-field $F'$ $F_1,F_2$ is the vector space over $F'$, and their bases, doneta $B_1,B_2$, has the same cardinal Then $F_1,F_2$ are isomorphism. It is clear that for any $a\in F_1$ we can linearly express it as $a=\sum_{i=1}^nk_ie_i$ where $k_i\in F'$ and […]Shore
- Understanding satisfaction and conversion from $\mathscr{L}$ to $D$ May 27, 2024I have been reading “Introduction to Mathematical Logic” by Elliot Mendelson (free pdf here) and I have found the way the author defines satisfaction, particularly a function $s^*$ that helps us define satisfaction, to be a little puzzling. Here is the relevant section of the text, on page 59. So the important concept we need […]Joa
- Do not understand solution to Write a formula with $\mathcal L_{NT}:={0,S,+,⋅,<,E}$ for "x is prime" from Leary and Krisiansen May 27, 2024I'm working through "A friendly introduction to logic" from Leary and Kristiansen and am struggling to understand the solution given to the question in the heading. The question is from Section 1.3.1, Exercise 3, and the answer given in the book is: $$Prime(\overline n):\equiv \overline 1 \lt x \land \lnot(\exists y)(\exists z)[(y + \overline 2) […]pandita

"Math Improve"
.999
1
assignment
assignments
calculus
exam #3
exam 3 grades
final papers
grading criteria
grading policy
graph theory
group
group paper
group project
homework
mathography
metacognition
openlab
OpenLab #4: Bridges and Walking Tours
Open Lab #6
OpenLab7
OpenLab 8
OpenLab8
Open Lab 8
Openlab8 Vi Hart
openlab assignment
perfect circle
points
presentation
project
resource
rubric
semester project
spring classes
Stars
vi hart
ViHart
visual math
Wau
webwork
week 8
week 14
welcome
written work

© 2024 2017 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