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

- $\Pi^0_3$ epsilon-delta definition for liminf or limsup for sequences April 1, 2023Regarding regular limits, given a sequence $\{x_i\}_{i \in \mathbb{N}}$ we say the $\Pi^0_3$ statement $x_i\rightarrow L$ iff $\forall \varepsilon>0 \exists N \forall n>N |x_n - L|< \varepsilon$ If ${x_i}_{i \in \mathbb{N}}$ is bounded we say $\liminf(x_i)=L$ iff $x_n < L+ \varepsilon$ for infinitely many values of $n$ $\exists m \in \mathbb{N}$ such that $\forall n […]P W
- Are these axioms sufficient as a logical foundation for ZFC? April 1, 2023My question is: are the following axioms sufficient as a logical foundation for ZFC? I just want to be sure that I'm not missing any axiom. I took them from the first chapter of the book "Foundations of Mathematics" written by Mohammad Safdari. A1: We assume that $\perp$ is a formula $x=y$ and $x\in y$ […]rfloc
- What is the proof theoretic ordinal of $\mathsf{B\Sigma}_{2}^{0}$? April 1, 2023My understanding of the bounding scheme is rudimentary. But it is an induction principle after all, just for a restricted class of formulas. Hence, it appears to me that the proof theoretic ordinal of $\mathsf{B\Sigma}_{2}^{0}$ (equivalently, $\mathsf{B\Pi}_{1}^{0}$) should be at least that of $\mathsf{RCA}_{0}$, i.e. $\omega^{\omega}$. On the other hand, it should not be larger […]John
- How can ZFC be inconsistent if it has a model? April 1, 2023I'm sorry to have to report a basic confusion about logic on my part, and apologise to those having to make an effort to put it right. Suppose that it was possible to derive a contradiction from ZFC. Then ZFC should have no model. But apparently, there are some models of ZFC; perhaps they are […]Cloudscape
- Does $\lnot(A→B) ⊢ A→\lnot B$ in classical logic? April 1, 2023Given $\lnot(A→B)$. Then $A˄\lnot B$. Assume $\lnot(A→\lnot B)$. Then $A˄\lnot\lnot B$. By DN, $A˄B$. Also $A˄\lnot B (\text{reit})$. Contradiction, therefore, $\lnot\lnot(A→\lnot B)$ by indirect proof, which by DN is $(A→\lnot B)$. So $\lnot (A→B) ⊢ A→\lnot B$.kwalia
- What are the proof-theoretic strengths of Ramsey's theorems? March 31, 2023Consider the following statements: Finite Ramsey Theorem ($\mathrm{FRT}$): For any $r,k,p\in\mathbb{N}$, there exists $N\in\mathbb{N}$ such that for any set $S$ of cardinality $N$ and any function $c:[S]^{p}\rightarrow [r]$ there exists a subset $H\subseteq S$ of cardinality $k$ such that $c|_{H}$ is constant. By $[r]$ we mean the set $\{1,\ldots r\}$, and the function $c$ is […]John
- Truth sets in mathematics March 31, 2023The definition of mathematical truth is confusing. Let P and Q denote the statements 'I'm a man' and '$1Nagbu
- Are Z and ZC equiconsistent? [closed] March 31, 2023Let Z be Zermelo's system without choice (C) and without axiom of foundation (AF), namely extensionnality, pair, union, power set, separation, empty set, infinity. I have two questions : (1) is Z equiconsistent with Z+C ? (2) is Z+AF equiconsistent with Z+AF+C ? (I know that ZF is equiconsistent with ZF+C)Ivan Marin
- Typed logic vs many-sorted logic March 31, 2023I am confused as to what is the difference between many-sorted logic and typed logic. Are they the same thing? If not, what are the differences?BonBon
- Textbook of logic and sets based on type theory [closed] March 31, 2023Are there any textbooks on logic and sets at the level of prior knowledge to calculus that are based on type theory?BonBon

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

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