Questions about logic and mathematical logic, including model theory, proof theory, computability theory (a.k.a. recursion theory), and non-standard logics. Consider using one of the following tags: (model-theory), (set-theory), (computability), (proof-theory) if they fit the question.

learn more… | top users | synonyms (1)

1
vote
1answer
19 views

translating a sentence into predicate calculus

I am supposed to translate the following sentence into predicate calculus: No Student likes the classroom. S(x) : x is a student C(x) : x likes the classroom I ...
7
votes
0answers
46 views

References on filter quantifiers

This post is primarily a reference request. In combinatorics and other areas, we use filter quantifiers to simplify the statements of various definitions, theorems and proofs. The general idea is ...
2
votes
1answer
29 views

translating phrases into propositional logic

translate the following into propositional logic: students attend the annual meetings where s: students A: attend annual meetings my first intuition is: s -> ...
6
votes
2answers
52 views

Ultraproducts and Elementary Embeddings

Let $K= \{A_i: i\in \omega\}$ be a countable collection of $L-$structures. Suppose that for each $A_i, A_j$ in $K$, $\exists A_p \in K$ such that $i,j< p$ and $A_i \prec A_p $ and $A_j \prec ...
0
votes
1answer
64 views

Translate an english sentence to first order logic

Here's an English statement - Politicians can't fool all of the people all of the time. (𝈗x for all things, P(x) x is a person, Q(x) x is a politician, T(x) x is a time and F(x, y, z) x can ...
0
votes
0answers
51 views

Is this an accurate description of structures and interpretations.

I read about structures and interpretations today. I've described them below this paragraph. Have I accurately described them? If not, what have I incorrectly described? A structure, $\mathscr{A}$, ...
0
votes
2answers
39 views

Do antecedents have to be true for the entire universal quantifier or just 1 case?

Sample: $$∀x ∈ R+,∃y ∈ R+, x < y ⇒ x > y$$ Say I tried y = 5. Do I need to check if the consequent is true for just the x values less than 5? Secondly, ...
0
votes
0answers
31 views

Proof of Correctness: Recursion inside loop

I am trying to prove the correctness of the algorithm in the research paper. It is at page 17 in the pdf. ...
4
votes
2answers
102 views

Formalize the sentence: “Earth is the only planet inhabited by mathematicians”

I have to formalize the sentence: "Earth is the only planet inhabited by mathematicians" Let: $P(x)$ stands for 'x is a planet' $M(x)$ stands for 'x is a mathematician' $I(x,y)$ stands for 'x ...
0
votes
0answers
28 views

Quick question about the relation between elementary classes and pseudo-elementary classes

Let $\mathcal{L}$ be a logic and $\mathscr{K}$ a class of structures in the vocabulary of $\mathcal{L}$. We say that $\mathscr{K}$ is a (basic) elementary class iff there is $\phi \in \mathcal{L}$ ...
-2
votes
0answers
33 views

Is there a generic, or international, naming of the Wyatt Earp Effect?

Since succumbing to the Wyatt Earp Effect (that is, entertaining the false belief that probability applies to the past) is a well-known logical fallacy, and therefore known in other languages, it ...
3
votes
2answers
139 views

Unexpressibility of a property in first order logic

We can give a very general notion of what is to iterate a function. Given a set $\mathcal U$ and a function $f:\mathcal U \rightarrow \mathcal U$, then, to iterate the function $f$ will mean to ...
0
votes
4answers
43 views

Can $(A \lor B) \land (\lnot A \land \lnot C)$ be more simplified?

Can $(A \lor B) \land (\lnot A \land \lnot C)$ be more simplified/expanded? With a kind of distributive property?
3
votes
1answer
75 views

If $P$ a probability of a sentence to be true, then $\{P(\phi | T_i)\}_{i \in \mathbb{N}}$ is a martingale over constructed theories $T_i$

I am reading Section 2.1 of Definability of Truth in Probabilistic Logic. For a language $L$, fix a probability distribution $P:L \to [0,1]$. Enumerate sentences $\phi_1, \phi_2, \ldots$ of a ...
0
votes
1answer
38 views

Big-Omega proof using L'Hopital's Rule?

Prove or disprove: $15n^2$ is in $\Omega(3 \times 2^n)$ So we'd have to prove or disprove this statement: $$ \exists c \in\mathbb{R}^+,\,\exists B\in\mathbb{N}, \forall n \in\mathbb{N}, n ≥ B ...
0
votes
0answers
62 views

Symbol for “Take Highest Number”

As the title states, is there a symbol for taking the highest value? Let's say we have two variables $a=2$ and $b=3$ now I want $aXb$ (where $X$ is the symbol I am looking for) and I want that answer ...
2
votes
2answers
85 views

A question on empty set and Russell's paradox

Suppose $S$ is a well-defined set and $A$ is meant to be a subset of $S$ that is defined as follows: $A = \{x|(x\in S)\wedge(x\not\in S)\}$. Is $A$ the empty set $\varnothing$, since it is based on ...
0
votes
1answer
52 views

Use Resolution to proove a sentence in First Order Logic

I was just wondering if anyone could tell me if I've solved this problem right. If wrong, I would like to know what I did wrong. "Use resolution to prove Green(Linn) given the information below. You ...
0
votes
4answers
50 views

proof for a problem in propositional logic

I cant find a proof for given problem: $$p \to ( q \to p) ≡ \lnot p \to ( p \to q ) $$ Please give proof to prove above statement.
7
votes
1answer
170 views

Are there non-equivalent cardinal arithmetics?

‎Generalizing a concept in mathematics is always a problematic situation. In most cases there are several ways to generalize a notion and it is not easy to decide if a particular generalization is ...
-2
votes
2answers
81 views

Combinatorics homework problem [closed]

In how many ways can $23$ different books be given to $5$ students so that $2$ of the students will have $4$ books each and the other $3$ will have $5$ books each?
0
votes
1answer
40 views

Did I do this big-Omega proof correctly?

Prove or disprove: 6n^3 – 4n^2 + 3n +2 is in Ω (5n^3 – n^2 + n +1). So I'm not sure if I did this right or not, any pointers or the correct steps would be helpful Ǝc ∈ ℝ+, ƎB ∈ ℕ, ∀n ∈ ℕ, n ≥ B ⇒ ...
2
votes
2answers
41 views

How would you prove in FOL that x is a member of {x} for all x?

How can I formulate and prove the following in first-order logic? $$\forall x (x\in \{x\})$$ I have the following two statements: member(x,$\alpha$) $\neg \exists y(\text{member}(y,\alpha )\land ...
4
votes
2answers
52 views

Formula for perfect squares spectrum.

I have been working on exercises from "A first Course in Logic" by S. Hedman. Exercise 2.3 (d) asks to find a first-order sentence $\varphi$ having the set of perfect squares as a finite spectrum. But ...
3
votes
2answers
42 views

origin of syntax for mathematical equations

Bear with me, I don't have any formal training in mathematics. I wonder if there is something that accounts for the syntax of mathematical equations, some deeper logic or reasons why I know that ...
1
vote
1answer
54 views

Proof of $p\rightarrow (\Box (\Box p \wedge p) \rightarrow (\Box p \wedge p))$

I need to prove: $$p\rightarrow (\Box (\Box p \wedge p) \rightarrow (\Box p \wedge p))$$ The system contains all propostional tautologies and the axiom scheme $\mathbf K$:$ \Box(p \rightarrow q) ...
0
votes
1answer
56 views

King Arthur and knights at the round table puzzle

Can you help me with this math problem: Each of the K knights from the round table needs to choose a card which is marked with a number from 1 to N, N >= K. The cards all have different number. ...
0
votes
1answer
52 views

Use mathematical induction to prove that any integer n>=2 is either a prime or a product of primes.

Use strong mathematical induction to prove that any integer $n\ge2$ is either a prime or a product of primes. I know the steps of weak mathematical induction... basis step= $p(n)$ for $n=1$ or any ...
1
vote
1answer
38 views

Given an open statement determine if their quantification is true

The Question My Work/Question My book says for part a, iv is true. I disagree. To show an existential statement is false we have to show that for all x that statement is untrue. There are no ...
1
vote
2answers
58 views

Consider $(\mathbb N, +)$ as a model for the language with one binary function $+$ . Are the following statements true?

Consider $(\mathbb N, +)$ as a model for the language with one symbol $+$ for a binary function. Are the following statements true? $(\mathbb N, +) \vDash \forall x \exists y \forall z\ x + y\neq z$ ...
2
votes
1answer
34 views

How to deal with long and tedious logic problem? [closed]

I am always pretty bad at logic problems. Because most of the logics used aren't really logical (to me)So, as you might think, a long logic problem only adds to it already boring nature. The ...
0
votes
1answer
20 views

A predicate logic question about write down a sentence

Let $\mathcal{L}=\{f\}$ be a first-order language containing a unary function symbol f, and no other non-logical symbols. Write down sentences $φ$ and $ψ$ of $\mathcal{L}$ such that for any ...
0
votes
2answers
59 views

Let $\Gamma = \{\exists x \forall y (x\mathrel R y),\exists x \forall y(y\mathrel R x),\forall x\exists y(x\mathrel R y)\}$. Is $\Gamma$ consistent?

Consider the language consisting of one symbol $R$ for a binary relation. Let $\Gamma = \{\exists x \forall y (x\mathrel R y),\exists x \forall y(y\mathrel R x),\forall x\exists y(x\mathrel R y)\}$. ...
3
votes
1answer
30 views

How to negate $\forall A. \exists a,b. a \neq b \land a,b \in P(A)$?

$$ \forall A. \exists a,b. a \neq b \land a,b \in P(A) $$ My intuition tells me it is false, because given $A=\emptyset$, then $P(\emptyset) = \{\emptyset\}$, so $a=b=\emptyset$. I proceeded to ...
-3
votes
1answer
141 views

SEVEN - NINE= EIGHT [closed]

Things are not always what they seem. What is true from one point of view may be false from another and vice-versa, and here is a puzzle to prove it. Despite the fact that every arithmetic teacher in ...
0
votes
1answer
41 views

If $a+b \geq x$ is known to be true does that mean $a+b\geq x-1$ contradicts it?

So I was proving something and I'm wondering if this line of argument is correct. Suppose that it is true that given conditions $M,N,O$; $a+b\geq x$. That is given those conditions the minimum value ...
0
votes
0answers
36 views

show that if A is creative then A is not computable

show that if $A$ is creative then $A$ is not computable? proof:If A is computable the $A$ andn the complement$A$ are computable enumerable. and $A$ is creative so there was a recsive function ...
0
votes
0answers
77 views

Let Γ = {p∧q,(¬p)∨q,p∨r}. Is it true that Γ ⊢ r?

I"m not sure how to solve this type of question. Here is the problem in more detail, and a similar problem: I know that given this set of formulas I'm supposed to show if its possible to deduce r ...
-1
votes
0answers
24 views

Equivalent sentences using logical connectives

Using only logical connectives implication ($\to $) and negation ($\lnot $), write a sentence equivalent to the sentence: $$ (p \land q ) \lor r $$ Using logical connectives disjunction ($\lor$) ...
0
votes
1answer
35 views

what is the meaning of this predicate statement

This question appeared in the GATE exam 2011 Q.32 Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate P(x) = ...
0
votes
2answers
71 views

Finding a formal deduction from an empty set of premises

I can't seem to make sense of any of this. I'm given a set of axioms schemes, modus ponens as the inference rule and I'm supposed to find a formal deduction. The question (question 1) is here. It ...
1
vote
2answers
29 views

How to specify each digit of a real number in decimal representation in set theory?

So real numbers have decimal representations. If you want to say the $n$th digit of some real number, how do you say this formally in set theory?
-2
votes
1answer
28 views

a formal logic proposition about real numbers

I have the following informal statement about real numbers: Every real number except zero has a multiplicative inverse. Can this be expressed as: $$ \forall x \exists y(x\neq 0 \implies xy=1) ...
0
votes
0answers
16 views

Find all n for which apply: If we shuffle pack 8 times we get the same order.

We have pack of cards 2n. Each mixing changes the order of cards of $a_1$, $a_2$, ..., $a_n$, $b_1$, $b_2$, ..., $b_n$ to $a_1$, $b_1$ ,$a_2$, $b_2$, ..., $a_n$, $b_n$. Find all n ...
0
votes
0answers
20 views

Formalize: “Every mail message larger then one megabyte will be compressed” [duplicate]

Formalize: Every mail message larger then one megabyte will be compressed
0
votes
2answers
46 views

what happens in a universal implication when the premise is false

I have just started learning Mathematical logic and couldn't figure out the answer to the above question . my question is what happens to the truth value if the premise in a universal implication is ...
0
votes
0answers
74 views

Logic puzzle of two numbers

The puzzle goes like this.. ...
0
votes
1answer
36 views

Proof for $∃xA⇔¬∀x¬A$

I want to prove, that $∃xA⇔¬∀x¬A$, using classic axioms. I think, I have to start with the following step: $∃xA⇔∃x¬¬A$ But I do not know, how to make this step, using axioms: $∃x¬¬A⇔¬∀x¬A$
1
vote
2answers
70 views

Hilbert's style proof (FO logic)

I am stuck with this question to check whether the following formulas are valid and if they are valid, then derive them using Hilbert's axiom schema and Modes Ponens for First Order Logic. ...
0
votes
0answers
30 views

Help with logical equivalence proof regarding a lemma for equivalence relations.

So the question is this: Suppose A is a set. Let ~ be an equivalence relation on A and let a,b be elements of A. Then Ta = Tb if and only if a ~ b. I need to prove this statement to be true. I know ...