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

- (LOGIC) How to prove P→~P ⊦ ~P? December 1, 2021I am in a basic level logic course and I can't figure this out for the life of me P→~P ⊦ ~P How to prove? Thanks in advanceJordan
- Representing first order sentences as conceptual graphs December 1, 2021Here are three first order axioms that represents a part a mereology theory. Reflexivity $\forall x : part(x,x)$ Antisymmetry $\forall x \forall y : ((part(x,y) \land part(y,x)) \implies (x = y))$ Transitivity $\forall x \forall y \forall z :((part(x,y) \land part(y,z)) \implies part(x,z))$ Here is my attempt to present these axioms as a set of […]Patrick Browne
- Proof of $x=y \rightarrow [P(x) \rightarrow P(y)]$ December 1, 2021I'm having a hard time with the proof $x=y \rightarrow [P(x) \rightarrow P(y)]$. I know that the generic steps are: (1) Given $x=y$. (2) Assume $P(x)$. (3) Since $x=y$ and $P(x)$, then, $P(y)$. Nevertheless, I would like a more detailed explanation on step 3. How can we infer that $P(y)$ derives from $x=y$ and $P(x)$, […]TylerD007
- Natural Deduction and Sequent Calculus December 1, 2021Are there any good natural deduction and sequent calculus solvers online for both predicate and propositional logic? Or perhaps forums that specialise in these proof systems?structures9818
- Compact cardinal cannot be successor? December 1, 2021This is a follow-up question to $\kappa$ is compact $\implies$ $\kappa$ is regular. The definition I'm using for "compact" is the same as there. I am trying to show if $\kappa$ is compact, then $\kappa$ cannot be a successor cardinal. My first attempt was as follows: Assume $\kappa=\lambda^+$. Let $\{p_\alpha\}_{\alpha \in \kappa}$ be propositional variables, […]Pascal's Wager
- Is there notation for undecidability? December 1, 2021Assume that it is undecidable whether P=NP. Is there notation for this statement? I have come across "¬□¬(P=NP)", which supposedly means that it is not provable, but it's clunky and not exactly the same meaning. Reading some undecidability proofs didn't yield anything either.MrMartin
- Definition of semantic consequence relation for substructural logics December 1, 2021How does one define the semantic consequence relation for substructural logics? What options are available. First a word on notation. Let $\mathbb{N}$ be the integers greater than or equal to zero. Also, I will only use set-builder notation in the form $\{v : \varphi(v)\}$ where $v$ is a variable to prevent ambiguity about variable scope. […]Gregory Nisbet
- Can every functional equation be solved or proved unsolvable? December 1, 2021Recently, I have read articles about how some identities whose "solution" either cannot be determined within $\mathsf{ZFC}$ or other axiomatic systems or the solvability is closely related to the consistency of the axioms. Here are a few examples: Tarski's high school algebra problem. In 1980, Alex Wilkie proved that the identity: $$ \left((1+x)^y+(1+x+x^2)^y\right)^x\cdot\left((1+x^3)^x+(1+x^2+x^4)^x\right)^y\\=\left((1+x)^x+(1+x+x^2)^x\right)^y\cdot\left((1+x^3)^y+(1+x^2+x^4)^y\right)^x $$ cannot […]Clement Yung
- Can a predicate be a contradiction? December 1, 2021In the university course I'm taking, a predicate is defined as a mathematical statement whose truth value depends on the variables involved in the statement. This definition makes me wonder whether a predicate can be a contradiction. For instance, if we use $P(x)$ to denote the statement "$x$ is an even number", clearly $P(x)$ itself […]Doero
- Question About Null Quantification Equivalences December 1, 2021I am currently a Philosophy student taking a logic course and I am confused about the concept of null quantification. And the LPL textbook, which we are using in class, introduces the idea, but it does not show much beyond basic examples such as the following: $$∀x \,P ⇔ P \text{ or } ∀x\, (P […]NorwegianWood

advice
advice for the future
advice from the future
advice from the past
assignment
assignments
Bridges
chapter 7
chapter 8
conjecture
date
exam
exam #3
exam 1
exam 2
exam 2 review
getting started
grades
group paper
homework
join
lockhart's lament
login
metacognition
midsemester grades
MIU puzzle
office hours
openlab
OpenLab #4: Bridges and Walking Tours
openlab 7
OpenLab8
OpenLab 8
openlab assignment
perfect circle
project
puzzle
reflection
resource
review
vi hart
Walking Tours
webwork
welcome
writing
written work

© 2021 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