Hi everyone,

As announced in class on Thursday, WeBWorK #4 has been extended by 1 week – it is now due on 9/27 at midnight.

NOTE: WeBWorK #3 is still due this Tuesday, 9/20, at midnight.

Best,

Prof. Reitz

Skip to the content

Hi everyone,

As announced in class on Thursday, WeBWorK #4 has been extended by 1 week – it is now due on 9/27 at midnight.

NOTE: WeBWorK #3 is still due this Tuesday, 9/20, at midnight.

Best,

Prof. Reitz

- Why is $f:\#_A\mapsto \#[A(^\circ\#_A)]$ computable? November 10, 2024In a proof of the Dagional Lemma, Wikipedia claims that the function $$f:n\mapsto \begin{cases} \#[A(^\circ\#_A)] & \text{ if $n = \#_A$ for some sentence $A$} \\ 0 & \text{ otherwise} \end{cases} $$ is computable, where $\#_A$ is the Gödel number of $A$ and $^\circ n$ is the numeral of $n\in\mathbb{N}$. How can we show that […]Sam
- Why does the existence of the $\text{Prf}(x,y)$ predicate not contradict the result that provability is undefinable in first order logic? November 10, 2024On the one hand, we have the following meta-theorem (Lemma 17.2 in Boolos et al. Computability and Logic): (Lemma 17.2) Let $T$ be a consistent theory extending $\textbf{Q}$. Then the set of Gödel numbers of theorems of $T$ is not definable in $T$. where the concept of "definable" was explained on the last chapter: We […]Sam
- Are complete and totally proper forcing the same? November 9, 2024See this question for the definition of totally proper forcing, which is confusingly called strongly proper in Cummings' handbook chapter (which clashes with the more recent notion of strong properness due to Mitchell). There is also the notion of complete forcing invented by Shelah; see for example Definition 2.2.1 of On subcomplete forcings by Minden. […]new account
- Is this theory a conservative extension of Heyting Arithmetic ($\sf HA$)? November 9, 2024Consider the following theory over some axiomatixation of first-order $\sf S4$ modal logic with equality: Universal generalizations of: $\neg s(x)=0$ $s(x)=s(y) \to x=y$ $x+0=x$ $x+s(y)=s(x+y)$ $x \times 0=0$ $x \times s(y)=(x \times y)+x$ $\Box (A(0) \land \forall y (A(y) \to A(s(y)))) \to A(x)$ Further, this theory is closed under Necessitation: From $\vdash A$, infer $\vdash […]PW_246
- Recursive Function to Count Sub-Expressions in Boolean Expressions November 9, 2024I'm working on a logic assignment and need some help defining a recursive function, countexprs. This function should, given a Boolean expression, return the total count of all sub-expressions within the expression. The expressions are defined by the following grammar: BExpr ::= bool | (BExpr ∧ BExpr) | (BExpr ∨ BExpr) | (¬BExpr) According to […]asfasfasf
- On a natural deduction rule concerning $\exists$ elimination [duplicate] November 9, 2024I wanted to see how a natural deduction proof system works, so I started reading these notes. On page four we find the following rule: $$\frac{ \begin{matrix} & & \left[\phi[t/v]\right]\\ & & \vdots\\ \exists v\phi & & \psi \end{matrix}} {\psi}$$ provided the constant $t$ does not occur in $∃vφ$, or in $ψ$, or in any […]Sam
- Why is propositional logic not incomplete? [duplicate] November 9, 2024I am struggling to understand the basics of logic. I don't understand the following. I know that in propositional logic the statement "A and (not B)" is true under certain interpretations of the symbols and false under others. It is also unprovable since it is not a tautology. This seems to me to be analogous […]Adam
- Trying to prove that $\exists x \forall y (Rxy \to Fa) \vdash \exists x \forall y Rxy \to Fa$ November 9, 2024I can't work out a formal deduction for $$\exists x \forall y(Rxy \to Fa) \vdash (\exists x \forall y Rxy) \to Fa,$$ and can't find any counter-model either.useruser334455
- Help With FOL Natural Deduction Proof ∀x∀y(R(x,y) ∨ x=y), ∀x∃y¬x=y ⊢ ∀y∃x(¬x=y ∧ R(x,y)) [closed] November 9, 2024So far, I only got the reversed universal and existential quantifiers. I can't use CQ rules or anything. Please helpWayfaring Stranger
- How was logical implication invented ? Trouble understanding it intuitively. November 9, 2024I'm a bit perplexed by implication as I can't make sense of it in any empirical manner. Could someone please indicate how it was invented or derived. I believe getting the intuition for implication in a derived sense will make sense to me rather then trying to justify it's existence by stating things like "a […]ImpliedCurious

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.

## Leave a Reply