Hi everyone,

Detailed information about your grade (not including the final exam or Project Reflection) can be found on the Grades page.

NOTE: This page is password-protected, the password will be distributed in class.

Best,

Prof. Reitz

Skip to the content

Hi everyone,

Detailed information about your grade (not including the final exam or Project Reflection) can be found on the Grades page.

NOTE: This page is password-protected, the password will be distributed in class.

Best,

Prof. Reitz

- OpenLab #1: Advice from the Past – 2019 Fall – MAT 2071 Proofs and Logic – Reitz on OpenLab #7: Advice for the Future
- Franklin Ajisogun on OpenLab #7: Advice for the Future
- Franklin Ajisogun on OpenLab #3: “Sentences”
- Franklin Ajisogun on OpenLab #6: Proof Journal
- Jessie Coriolan on OpenLab #7: Advice for the Future

- Structural Induction Proof for Recursive Functions on Boolean Expressions November 11, 2024I'm working on a set of problems in my logic course, where we're dealing with recursive functions that count specific types of subexpressions in Boolean expressions. Here’s the context from the previous problems, which define the functions I need to use for the proof in Problem 3. Some background We defined a recursive function called […]asfasfasf
- in Kunen set theory forcing part, how to show this set is function? November 11, 2024I read Kunen's set theory pp.192-3. in this page, example said that p forces certain set is function; ... but I don't understand how to first set can be function; because |P is set of functions, so it seems that there are distinct function x, y in |P s.t. x(0)= 0, y(0)=0, but x contains […]유준상
- Solution verification of proof that $∃x(P (x) → ∀yP (y))$ November 11, 2024The book "How To Prove It - A Structured Approach 3rd Edition" by Daniel J. Vellman contains the following exercise: Prove $∃x(P (x) → ∀yP (y))$. (Note: Assume the universe of discourse is not the empty set.) Please, verify whether my proof is correct. Proof: Suppose $U$ is any particular but arbitrary chosen universe of […]Vlad Mikheenko
- Justifying vacuous truth in a conditional statement by using the concept of vacuous truth in universal quantifiers [duplicate] November 11, 2024$$\require{amssymb} \forall x\in\varnothing; P(x)$$ We know that this is true, because its negation states there is at least one $x$ in empty set so that $\neg P(x)$ is true, which is false; because there isn't anything in empty set! Its negation is false so it is true itself. I was thinking of something like this […]user1471097
- A question regarding tautologies and quantifiers November 11, 2024We know that $(P \implies Q) \vee (Q \implies P)$ is a tautology, yet the statement $$ \forall x \, \left( x \in A \implies x \in B \right) \vee \left( x \in B \implies x \in A \right), $$ which simply means $$ A \subseteq B \vee B \subseteq A, $$ isn't necessarily true. […]Noam
- How can I show that you can't define an inner product from an isomorphism to the dual space? November 11, 2024An isomorphism $T$ from a finite-dimensional vector space $V$ to its dual $V^*$ induces a bilinear form on $V$ via $(v,w) \mapsto T(v)(w)$. If this bilinear form happens to be symmetric and positive definite, it will give an inner product. Usually this will fail to be the case, but one might wonder if there is […]gmr
- Tarski's Lemma in book Models and Ultraproducts November 10, 2024I'm currently reading the book Models and Ultraproducts by Bell & Slomson. In section $4$ of chapter $1$, they present a result they refer to as Tarski's lemma. (I have rephrased the statement so that it's more readable) Theorem 4.10. Let $\{A_{n}\}_{n \in \omega}$ be a countable collection of subsets of a Boolean algebra $B$ […]Kevin López Aquino
- Is there implicit Universal quantification in this definition? November 10, 2024Working on: Richard Johnsonbaugh. (2018). Discrete Mathematics, 8/e (p. 600) Definition 12.3.5: Let $G = (N, T, P, \sigma)$ be a grammar. If $\alpha \to \beta$ is a production and $x\alpha y \in (N \cup T)^{\ast}$, we say that $x\beta y$ is directly derivable from $x\alpha y$ and write $$x\alpha y \Rightarrow x\beta y$$ My […]F. Zer
- Are there natural deduction inference rules for function symbols? November 10, 2024This set of notes on natural deduction does not have rules of inference for function symbol. Is that supposed to be the case, or are the notes dealing with first-order logic without function symbols?Sam
- How do we know the predicate $\text{Proof}(x,y)$ exists? November 10, 2024On a proof (sketch) of Gödel's Incompleteness Theorems, the following predicate is defined and used: Let $\text{Proof}(x, y)$ be a binary predicate that translates "$x$ is the Gödel number of a proof of a formula whose Gödel number is $y$". How does the author know that there is a formula $\text{Proof}(x,y)$ with that property?Sam

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

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