Here are the final drafts of the “Group Process Papers.” Assessment details will be sent out shortly. Great work, everyone!

group conjecture paper – Josvenia Miralia Sonam Evelin

Skip to the content

Here are the final drafts of the “Group Process Papers.” Assessment details will be sent out shortly. Great work, everyone!

group conjecture paper – Josvenia Miralia Sonam Evelin

- How could I formally express: System F cannot express universal quantification over things that are not types? September 8, 2024I'm trying to understand exactly why it is that https://ncatlab.org/nlab/show/computational+trilogy states that quantification requires dependent types, and why this wouldn't be possible to achieve with System F. From what I've managed to gather, System F can express quantification, but only over types, and not over elements or predicates. I'm looking for a way to formalize […]shintuku
- Can we always prove whether a statement is undecidable by adding consistency strength? September 8, 2024So, if a statement is independent of a list of axioms then the system cannot prove it. For example, CH is independent from ZFC. But if we accept ZFC is consistent then we can prove CH must be independent of it. Of course because of Gödel's incompleteness theorem we can cook up more statements that […]Pineapple Fish
- construction of truth table for $(P \implies Q) \vee R)$ September 8, 2024construction of truth table for $(P \implies Q) \vee R)$ So here's my attempt :- \begin{array}{|c|c|c|c|c|} \hline P & Q & P \implies Q & R & (P \implies Q) \vee R \\ \hline T & F & F & {F\\T} & {F\\T} \\ \hline T & T & T & {T\\F} & {T\\T} \\ […]math and physics forever
- Are Compactness for FOL and the Pumping Lemma for RL/CFL two instances of the same phenomenon? September 7, 2024As title states, I'm curious whether my intuition for the Compactness result for FOL and the Pumping Lemma for RL/CFL being two expressions expressions of the same phenomenon (that is: an attempt to capture the infinite through finitary means) might be wellfounded. The idea is precisely that: In Compactness one gets that, due to the […]Sho
- What is a predicate in first-order logic, formally? [duplicate] September 7, 2024Recently, I am trying to gather together a consistent 'foundation of mathematics' from several sources/books/scripts which satisfies me as a 'working mathematician'. When, for example, I want to start with set theory, I have to formulate the axioms of ZF (or ZFC). For this - in particular for the axiom schema of specification - I […]mrpotato
- how to prove well-ordering isomorphic theorem? September 7, 2024I am reading well-ordering isomorphism theorem in Kunen's "set theory : an intro function to independence proofs(1980)" here, "pred" refers to initial segment for an element x in A under relation R. at first glance, if we define f in the above way, it seems that if A's cardinal less than B, then (b) will […]유준상
- Inclusion in a set using formal logic September 7, 2024I am having trouble understanding the definition of a subset in terms of formal logic, I want to prove that these statements are logically equivalent: Let $A,B$ be subsets of $E$ $$ A\cap B = \emptyset \\ \equiv \\ A\subset (B\cap \bar{A}) \\ \equiv \\ B\subset (A\cap \bar{B}) $$ Here is my question: Take $A\subset […]realreal
- Continued fractions inspired propositions: What do these have in common in terms of truth values? September 6, 2024Suppose a single logic binary relation (i.e., any of those in $\{\lor, \land, \to, \leftrightarrow\}$) were to take the place of addition in a continued fraction, with $\neg$ as taking multiplicative inverse and the values in the fraction being propositions. For example, for $\lor$, a "continued fraction" would be $$[A; B, C]_\lor:=A\lor\neg(B\lor\neg C).$$ (Here the […]Shaun
- Help on a proof using implication [duplicate] September 6, 2024I am trying to prove the following statement: Let $a,b\in \mathbb{R} \setminus \{0\}$ $$ [(\exists n \in \mathbb{N} : a=nb) \wedge (\exists n \in \mathbb{N} : b=na)]\Rightarrow a = b $$ Here is what I've come up with: $$ [(\exists n \in \mathbb{N} : a=nb) \wedge (\exists n \in \mathbb{N} : b=na)]\Rightarrow a = b […]realreal
- Using primitive recursion for defining a function of one argument September 6, 2024I have a problem with some details of the proof that the predecessor function is a primitive recursive function -- in particular with how primitive recursion operation is used here. Primitive recursion is the following operation: it takes $g : \mathbb{N}^k \to \mathbb{N}$ and $h: \mathbb{N}^{k+2} \to \mathbb{N}$, and returns $f : \mathbb{N}^{k+1} \to \mathbb{N}$ […]wiktoria

"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