Hi everyone,

The grades for Exam #3 are posted on the “Grades” page – the exams will be returned on Tuesday. Let me know if you have any questions.

Regards,

Prof. Reitz

Skip to the content

Hi everyone,

The grades for Exam #3 are posted on the “Grades” page – the exams will be returned on Tuesday. Let me know if you have any questions.

Regards,

Prof. Reitz

- How do I solve the exercise 2.2.5 (a) from Modal Logic? June 25, 2024It provides me with two models M0=(R,Hannibal-Barca Yang
- Is truth value the only type of value which can be logically preserved by means of semantic consequence? [closed] June 24, 2024Is a formal system of semantic consequence (as opposed to syntactic consequence) with a value having nothing to do with truth possible? I'm not here interested in n-valued logics which include truth and falsity, (for example, a four-valued logic with the possible values of true, false, both, and neither).FreeThought
- Is it possible to deduce $\vdash \psi$ from $\{\varphi\}\vdash \psi$ and $\{\neg \varphi\}\vdash \psi$ in fuzzy logic? June 24, 2024Assume we are in Basic Logic introduced in here (fuzzy logic), and we have $\{\varphi\}\vdash \psi$, and $\{\neg \varphi\}\vdash \psi$. Can we conclude that we have $\vdash \psi$? Or do we have to provide a proof? Can I consider it as obvious? If we have to prove it, where should I start?Doralisa
- Given a strong enough theory, why is $\operatorname{Richardian}(n)$ ill-defined? June 24, 2024Richard's paradox (on natural numbers) can be summarized as follows: Let $R$ be an enumeration of all the possible unary predicates that can apply to natural numbers. Perhaps, for example, $R_1(n) := n\text{ is even}$, $R_2(n) := n\text{ is odd}$, $R_3(n) := n\text { is prime}$, $...$, $R_{53}(n) := \exists m : n^2 = 3m […]Feryll
- Proof of bijection between $S_1(R,\underline{R})$ and the set of cuts in $(R,<)$ June 24, 2024Hi guys I am trying to solve the following exercise but without great success and I hope you can help me: "Let $\underline{R}$ be a real closed field (RCF). Show that $S_1(R,\underline{R})$ is in one to one correspondence with the set of cuts in $(R,WiggedFern936
- Logic, deductive systems and mathematics June 23, 2024I'm studying logic as part of my discrete mathematics course, and while the book does a good job at explaining propositions, connectives, quantifiers, proofs, etc, in a mechanical way, I'm trying to get a deeper understanding of how logic explains mathematics. I've developed a personal framework as to how everything is connected, but my formal […]Daniel
- How to show that if T is a decidable L-theory then the set of all L-statement is recursively enumerable June 23, 2024Consider the following theorem Each L-theory consistent and decidable can be extended to a L-theory which is consistent, decidable and complete. The main idea of the proof is to build an increasing succession of consistent theories starting from T and adding step by step a L-sentence or its negation. To make this construction possible it […]RobB
- Why does $\forall n \in \mathbb{N} \vdash P(n)$ not imply $\forall n \in \mathbb{N}P(n)$? June 22, 2024I am trying to understand why $\forall n \in \mathbb{N} \vdash P(n)$ doesn't imply $\forall n \in \mathbb{N}P(n)$ by studying the concepts in this answer, and had 2 questions about the difference between $\forall n \in \mathbb{N} \vdash P(n)$ and $\forall n \in \mathbb{N}P(n)$: Why does $\forall n \in \mathbb{N} \vdash P(n)$ only make sense […]Princess Mia
- Why is $\{A \land \neg A\} \vdash \neg\neg B$ in this deduction tree? June 22, 2024I'm reading through an introduction to logic textbook and cannot follow an example on natural deduction rules. I couldn't find a way to nicely typeset the deduction tree in MathJax, so I'll instead name each deduction with a roman numeral and build the tree by referencing those names; please do advise me on a better […]Emma
- Why doesn't this diagonal argument work? June 22, 2024I have a question about the standard rules for computing p.r. terms (see below). It seems pretty clear that these rules could be used to define a p.r. operation that evaluates any p.r. term of the form $f_n(n)$. But we know that such an operation does not exist, due to diagonalization arguments. What am I […]nontology

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

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