Skip to main content

Questions tagged [first-order-logic]

For questions about formal deduction of first-order logic formula or metamathematical properties of first-order logic.

0 votes
2 answers
97 views

I know that every Turing machine can be represented by a unique number and similarly every First-order logic + Peano sentence can be coded into a unique number as well. Similarly I have read that ...
Lauri's user avatar
  • 31
1 vote
0 answers
108 views

Let $\phi(\alpha,\beta,\gamma,\delta)$ be a quantifier-free, first-order formula having free variables only amongst $\alpha,\beta,\gamma,$ and $\delta$. Let $\mathcal{F}$ denote the set of functions ...
Pineapple Fish's user avatar
4 votes
2 answers
453 views

Keisler's Elementary Calculus. An Infinitesimal Approach defines $L$ is the limit of $f(x)$ as $x$ approaches $c$ if whenever $x$ is infinitely close to but not equal to $c$, $f(x)$ is infinitely ...
Oscar Vernon Rodríguez's user avatar
4 votes
1 answer
178 views

I will preface this question by stating that, although it concerns mathematics education, I think it is more suited for this platform than, for example the Mathematics Educators Stack Exchange, as it ...
Carlyle's user avatar
  • 4,413
3 votes
1 answer
84 views

Let $F$ be a field and let $T$ be its complete, first order theory in the language of rings. I'm pretty sure $T$ can never be $\omega$-categorical, but I have not been able to find a proof. If char$(F)...
Susana Santoyo's user avatar
1 vote
1 answer
146 views

I would like to see if I am translating correctly from natural language into logic with symbols. Let's say I have the following result: Let $m,n\in\mathbb{N}$, $A\in\mathbb{Q}^{m\times n}$, $b\in\...
Marc Dinh's user avatar
  • 425
5 votes
0 answers
212 views

Now cross-posted to MO. This is a follow up to my previous question: Let $\mathcal{L}$ be a countable language and $M, N$ be two structures over $\mathcal{L}$. Suppose $|M| = |N| = 2^{\aleph_0}$ and ...
David Gao's user avatar
  • 26.5k
0 votes
0 answers
48 views

I should clarify the proof system I am talking about. In this system we prove things in the following way: given a set $\{\Gamma_1,\Gamma_2,...\}$ of closed statements in first order logic, $\Gamma$ ...
Pineapple Fish's user avatar
2 votes
1 answer
117 views

It is an established fact that with a non-empty universe we have $\forall x\phi(x)\implies\exists x\phi(x)$. But suppose we prove $\exists x\phi(x)$ is a tautology. Then we have shown the negation $\...
Pineapple Fish's user avatar
4 votes
3 answers
140 views

What is the predicate expression for statement : "Some fragile items are transparent only if they are glass." Let: $Fx = x$ is fragile item $Tx = x$ is transparent item $Gx = x$ is glass ...
user14271528's user avatar
1 vote
2 answers
176 views

Premises: All managers are employees. Some employees are contractors. No contractors are full-time workers. Only full-time workers receive benefits. To infer: Some employees receive benefits only if ...
user14271528's user avatar
-1 votes
1 answer
46 views

Proof that anything unique also has at most 2 instances (since it has at most 1 instance) The graph in question is a cut with a line of identity crossing the cut's boundary (sort of like a power ...
Grant Langdon's user avatar
8 votes
1 answer
350 views

Let $\mathcal{L}$ be a countable language and $M, N$ be two (not necessarily countable) structures over $\mathcal{L}$. Suppose $|M| = |N|$ and they furthermore satisfy the following condition: For ...
David Gao's user avatar
  • 26.5k
0 votes
2 answers
91 views

Problem Statement: I am working on a problem from my Discrete Mathematics course regarding translating natural language into predicate logic. Let $L(x, y)$ be the predicate "$x$ loves $y$" ...
162. Tấn Thịnh - 11A3's user avatar
11 votes
5 answers
1k views

In the book "Logic: The Laws of Truth" by Smith, N., the author has the following definition: "$\exists x\alpha(x)$ is true in $M$ if, and only if, there is at least one object $o$ in ...
user1735036's user avatar

15 30 50 per page
1
2 3 4 5
661