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

- Matter of Convention? May 23, 2024Why is the subset relation defined as $ A \subseteq B \iff \forall x \, (x \in A \implies x \in B)$ as opposed to $\bigwedge_{i=1}^{|A|} \exists x_{i}[(x_{i} \neq x_{i+1})\land((x_i \in A)\land(x_{i}\in B))]$? The latter does not account for the empty set, which is deliberate. Is this a matter of convention?Daniel
- Functions which commute with arbitrary unions May 23, 2024Let $A,B$ be sets and $f: \mathcal{P}(A) \to \mathcal{P}(B)$ be a function. What does it mean to say that such a function "commutes with arbitrary unions"? I read this expression in Exercise 1.1, p.11 of the book "Abstract Algebraic Logic", by Font. I presume it means for that for any $X \in \mathcal{P}(A)$ we have […]user65526
- Necessity of universal quantifier to represent a theorem with logic symbols May 23, 2024I have a preference to reduce the proof steps of a theorem, and the theorem itself, into logic symbols as much as possible. Not just because it is aesthetically appealing, but because it makes makes things simpler and faster when studying, or when one wants to write down any proposition without excess. Since i started […]Davi1399
- Is a single unprovable formula enough for consistency? May 23, 2024In axiomatic logic, the principle of explosion says that any formula of a system can be proven to be true if the system contains a contradiction. So, in an inconsistent system, both a statement and its negation are derivable from the axioms. I am wondering whether we can say that a single unprovable formula of […]Barney
- Where can I find proofs like this with their solution? May 23, 2024I want question with their answers that use logical axioms for proofs like below. [1]: https://i.sstatic.net/2ftI3GfM.pngAES
- Linear logic with contraction May 23, 2024What is the proof system obtained when adding a contraction rule to linear logic or removing the weakening rule from intuitionistic logic? In other words, what goes in the missing cell of the following table? No contraction Contraction No weakening Linear logic ? Weakening Affine logic Intuitionistic logic Intuitively, this will mean that one has […]Georg
- "Irreducible" axiomatic systems? May 23, 2024So I was playing with axiomatic / formal systems and wanted to look into this property about formal systems which could be called "irreducibility". It is similar to independence in that it restricts the axioms from having redundant information. Here is how I define the property. Suppose we have a theorem $T$ in our system, […]qucchia
- How can something be both a primitive notion and be axiomatically defined like it is here? May 23, 2024This resource states that In mathematics, the notion of a set is a primitive notion. That is, we admit, as a starting point, the existence of certain objects (which we call sets), which we won’t define, but which we assume satisfy some basic properties, which we express as axioms. I am confused why we can […]Princess Mia
- Can Null Quantification be applied in this case (from Rosen's Discrete Math textbook? May 23, 2024Express the statement “Everyone has exactly one best friend” as a logical expression involving predicates, quantifiers with a domain consisting of all people, and logical connectives. Solution: The statement “Everyone has exactly one best friend” can be expressed as “For every person x, person x has exactly one best friend.” Introducing the universal quantifier, we […]Bob Marley
- Why is addition not completely defined here? May 23, 2024Say for the natural numbers, we define addition this way: $0 + 0 = 0$, and if $n+m = x$, then $S(n) + m = n+S(m) = S(x) $ Say we have the regular Peano axioms, except we delete the axiom of induction and add the following axiom: $\forall n \in \mathbb{N} \exists k,l \in […]Princess Mia

"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