Hi everyone,

Your midsemester grades, which include the grades for Exam #2, are now posted on the Grades page. Let me know if you have any questions, and send me an email if you have forgotten the password to the Grades page.

Regards,

Prof. Reitz

Skip to the content

Hi everyone,

Your midsemester grades, which include the grades for Exam #2, are now posted on the Grades page. Let me know if you have any questions, and send me an email if you have forgotten the password to the Grades page.

Regards,

Prof. Reitz

- Introductory modal logic book for mathematicians August 10, 2024I am a mathematician who never had a course in logic, and I'd like to learn about it, especially modal logic and the relationship with topology. Can you recommend me an introductory book? Feel free to ask me any questions that may be relevant to choose the recomendations.user210089
- Implication in one-to-one function definition August 10, 2024Reading Tao´s Analysis, I have seen the following definition of one-to-one functions: I am thinking about something rather simple here: Shouldn´t the implication be an equivalence instead? I thought about the following: We have the statement: $x \neq x´ \rightarrow f(x) \neq f(x´)$. Then we have the four cases for every $x$,$x´$ pair: $x \neq […]Ufuk Can Bicici
- How to avoid ambiguity when there are multiple ifs and/or multiple conditions in the same sentence? [closed] August 10, 2024The word if frequently introduces ambiguity. For example, the sentence "for any $(a,c,b,c) \in A$, $a=1$ if $b=1$ and $c=1$" can be interpreted as "$a=1$ if $b=1$ and $c=1$", which is usually my intention, or as "$a=1$ if $b=1$" and "$c=1$ always". A solution could be to write "$b=1 \land c=1$", but I often want […]Jonathan
- Is there any way to estimate inconsistency probabilty? August 9, 2024Suppose one is given some language $\mathfrak{L}$. Is there any way to estimate the probability that a randomly chosen set of $n$ formulæ (all of length $\leq k$) is inconsistent?Sho
- Abstracting the Undecidability of the Halting Problem August 9, 2024Let us work in some constructive metalogic (where we have at least the following: Natural numbers, Booleans, Lists, Disjoint Union, and Sets). To reason about Turing machines, we could (probably) define the following (metalogical) functions and sets: TMData : Set == Seq(Bool) // TMData is the set of all finite boolean sequences TMEval(alg: TMData, input: […]Suraaj K S
- Are infinite proofs legitimate? August 9, 2024Of course any proof must be, in the most literal sense, finite (must be written down on a finite stack of paper or storage drive of finite capacity). But even on a finite piece of paper one can construct "effectively infinite" statements. For example, suppose I define infinite class of (finite) first-order logic formulas, e.g. […]NikS
- Modern Understanding of Frege's Definition of a Number? [closed] August 9, 2024Is there a way to understand Frege's definition of a number using modern approaches to type theory (whether constructive or non-constructive) instead of set theory?Justify
- Horn sentences and power structures August 8, 2024It is well-known that Horn sentences are "preserved" under products (see for instance Show that the direct product of structures satisfies a Horn sentence). I was wondering what happens with the converse. I.e. if a Horn sentence is true in the product is it true in the components? What if all components are equal (i.e. […]user1868607
- Examples of statements provable in PA whose corresponding propositional tautologies don't seem to admit short extended Frege proofs August 8, 2024Bounded arithmetic has been studied because if a statement provable using certain forms of bounded arithmetic is transformed into a family of propositional tautologies (which can be done if the statement is of a certain form), the proof can be transformed into a family of polynomially-long proofs in certain propositional proof systems. For example, as […]Duyal Yolcu
- The well-ordering number of second-order logic August 8, 2024The definitions and referred pages are from (Model-Theoretic Logics, Barwise 1985), primarily from chapter II. A free version is available here: Chapter II Definition (pinning down ordinals): Let < $\in$ $\tau$ and $\Phi$ $\subseteq$ $\mathscr L$[$\tau$] for $\mathscr L$[$\tau$] is the class of all $\mathscr L$-sentences of vocabulary $\tau$. We say that $\Phi$ 'pins down' […]SJe967

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