I forgot to get either of your contact information. So I figured I’d make a post and hope you guys (including Prof. Reitz) see this. If you have any comments or criticism, lay ’em on me. This is an inital draft so it’s not complete, currently juggling three essays T.T
Logic on Math StackExchange
- Specifying Calculus of Constructions (or something similar) in LF March 29, 2023Consider LF, the logical framework used to define UTT (unified theory of dependent types). The next two quotes are from here. LF is a simple type system with terms of the following forms: $$\textbf {Type}, El(A), (x:K)K', [x:K]k', f(k),$$ where the free occurences of variable $x$ in $K'$ and $k'$ are bound by the binding […]user125234
- Are “if / iff” interchangeable for “when / whenever”? March 29, 2023Let $A$ and $B$ be arbitrary sets and consider the following two statements: \begin{gather} (x\in A)\Rightarrow (x\in B)\\ (x\in A)\Leftrightarrow (x\in B) \end{gather} These two statements are usually worded as follows: If $x$ belongs to $A$, then $x$ belongs to $B$” “$x$ belongs to $A$ if and only if $x$ belongs to $B$”. My questions […]Hector
- How do Robinson arithmetics axioms prevent this model of N? March 29, 2023In the Peano arithmetic wikipedia article, a figure is shown on why the axiom of induction is necessary, without it, the set of whole dominos would be a valid representation of N In Robinson arithmetic, we have the axiom y=0 ∨ ∃x (Sx = y) instead. I don't see how this axiom prevent that situation, […]user2370139
- A question about changing EM blueprints in AECs March 29, 2023I'm currently reading some notes on AECs (here), and just wanted to make sure I understand the argument in Corollary 12.8, for I'm still getting used to generalized Ehrenfeucht-Mostowski models in AECs. As far as I understand, EM blueprints/templates $\Phi$ keep track of the quantifier-free sentences some indiscernible satisfies (that is, a single $n$-type for […]interregno
- In the class, there are $30$ students March 29, 2023I am preparing to take an entrance exam for a university in my country, which will happen soon. As part of my preparation, I have been practicing with some sample math tests provided by the university. However, I recently came across a math problem that I could not understand at all. This is the exercise: […]Simebe
- Why do we care about the decidability of a theory? March 29, 2023I'm new to logic theory and i'm stuck with the understanding of decidability of a logical system. As far as I understand, the decidability of a logical system is related to the existence of an effective (in terms of time) procedure to tell whether a given formula can be proved by using the "instruments" of […]InTheSearchForKnowledge
- Free variables in derivation systems March 29, 2023I work relative to a fixed first-order language $L$. As usual I call those formulas which do not contain free variables sentences. There are several derivation systems for first-order logic. For example, in Goldrei's Propositional and Predicate Calculus a derivation of $\psi$ relative to a set $Ax$ of sentences is a list of formulas $\phi_1,....,\phi_n$ […]Nico
- Is every limit computable set in the Ershov hierarchy? March 29, 2023A set is limit computable, or $\Delta^0_2$, if its characteristic function is equal to $\lim_{s\rightarrow\infty}g(x,s)$ for some total computable function $g$. And given a computable ordinal $\alpha$ and a path $P$ through Kleene's $O$, a set is $\alpha$-c.e. if its characteristic function is equal to $\lim_{s\rightarrow\infty}g(x,s)$ for some total computable function $g$ such that there […]Keshav Srinivasan
- Theorems (or references to analysis) of a particular Hilbert-deductive-system using $\\{\neg, \wedge, \vee, \rightarrow\\}$ as primitive symbols? March 29, 2023Context The System CL In section 6.3 of Topoi, Robert Goldblatt describes a Hilbert-style deductive calculus (the only inference law is modus ponens) for the propositional logic of a language with the primitive logical connective symbols $\\{\neg, \wedge, \vee, \rightarrow\\}$, which he calls CL, with following axiom schemata: $\alpha\rightarrow(\alpha\wedge\alpha)$ $(\alpha\wedge\beta)\rightarrow(\beta\wedge\alpha)$ $(\alpha\rightarrow\beta)\rightarrow((\alpha\wedge\gamma)\rightarrow(\beta\wedge\gamma))$ $((\alpha\rightarrow\beta)\wedge(\beta\rightarrow\gamma))\rightarrow(\alpha\rightarrow\gamma)$ $\beta\rightarrow(\alpha\rightarrow\beta)$ $(\alpha\wedge(\alpha\rightarrow\beta))\rightarrow\beta$ $\alpha\rightarrow(\alpha\vee\beta)$ […]Alexander Sanchez
- Is Robinson arithmetic the weakest incompletable system of arithmetic? March 28, 2023Robinson arithmetic (Q) is weaker than PA. We know that any theory that interpret Robinson arithmetic will be incomplete as well. It seems Robinson found his axioms noting what was necessary to conclude the incompleteness proof. But what if there is some very strange axiom system we don't really think that is connected to arithmetic, […]Lost definition
Thank you Ismail , I read the initial draft and I really like it , Hopefully we will add more to it before we subimtted the final paper