# Tag Info

### Why is A implies B true if A is false and B is false?

Humans are bad at logic until they have to employ it to figure out human affairs. Think of "if $A$ then $B$" as a kind of promise: "I promise to you that if you do $A$ then I will do $B$". Such a ...
• 29.1k

### Can proof by contradiction work without the law of excluded middle?

You asked (I am making your question a bit crisper): "What formal guarantee is there that it cannot happen that both $\lnot p$ and $p$ lead to a contradiction?" You seem to worry that if logic is ...
• 29.1k
Accepted

### Why does soundness imply consistency?

I recommend looking into formal logic beyond vague, hand-wavy descriptions. It's interesting and highly relevant to computer science. Unfortunately, the terminology and narrow focus of even textbooks ...
• 11.9k

### Why do ¬, ∀ and ∃ have the same precedence?

Order of precedence is simply a notional convenience. There is no notion of strength here, just notation. All three operators are unary operators with notation "$\circ\ \cdot$", where $\circ$ denotes ...
• 7,258

### Why is A implies B true if A is false and B is false?

It's a convention -- we could use a different one, but this one is convenient. Here's what Terence Tao says: This is discussed in Appendix A.2 of my book [Analysis 1]. The notion of implication ...
• 261
Accepted

### How is ‘x + ½ = 2 and x ∈ ℤ’ an open statement?

$$x=1$$ $$∃x: x=1$$ The first is an open statement, since no value for $x$ is given. $x$ is called a free variable here. The second is a closed statement, because it talks about all possible values of ...
• 320
Accepted

### Predicate Logic Notation: What does a "dot" mean?

The dot just means "such that"; it's often omitted. The difference between the two formulas is the difference between "everybody has a mother" and "there is somebody who is everybody's mother."
• 80.9k
Accepted

### What is the relation between First Order Logic and First Order Theory?

First-order logic is a mathematical subject which defines many different concepts, such as first-order formula, first-order structure, first-order theory, and many more. One of these concepts is first-...
• 273k
Accepted

### Can I use ellipses in first order logic

Strictly speaking, your statement is invalid because $\ldots$ is not part of the syntax of first-order logic. However, your statement is an abbreviation of a statement in first-order logic. For ...
• 273k

### Why is A implies B true if A is false and B is false?

"A implies B" means (short) "if A is true then B is true". It means (a bit longer) "if A is true then I claim that B is true; if A is false then I don't make any claim about B whatsoever". Now ...
• 27.1k
Accepted

### Algorithm for deciding alpha-equivalence of terms in languages with bindings

There are several ways to do what you want. One of them is to use a different syntax representation under which $\alpha$-equivalent terms are actually equal. Such representations go under the name ...
• 29.1k

### Undecidable predicate logic is decidable by people?

The author is incorrect. A consequence of Godel's incompleteness is that any sufficiently complex logic has statements that are true, but have no proof of truth. If every statement had a proof or ...
• 29.4k
Accepted

### How to understand quantifier without predication " ∀(λφ. (φ x m→ φ y))"?

The $x$ in $\forall x . P(x)$ is not an argument. It is a bound variable indicating which variable the quantifer is ranging over. Let us compare the situation to the definite integral, for concretness ...
• 29.1k

### How is ‘x + ½ = 2 and x ∈ ℤ’ an open statement?

Whether it's an open statement or not depends on the structure of the statement, no on whether you can prove the truth value. Look at the second statement. There are three things you could substitute: ...
• 27.1k

### What is the relation between First Order Logic and First Order Theory?

The phrase "first-order logic" has two meanings: It is a chapter of mathematical logic in which we study certain kinds of formal systems and everything related to them. It is a special kind of first-...
• 29.1k
Accepted

### Why k- Vertex Cover is not in PTIME when it can be expressed in FO-logic

Your argument shows that for each fixed $k$, the problem $k$-VC can be solved in polynomial time (indeed, the algorithm enumerates all sets of size $k$ and checks whether they are vertex covers, all ...
• 273k
Accepted

### Any Non-trivial Logic System Defined with only Equality

If all you have is equalities and uninterpreted function symbols, then you have an algebraic theory a la universal algebra. A singleton set (or a collection of them in the multi-sorted case) is always ...
• 11.9k

### Can proof by contradiction work without the law of excluded middle?

I think your question boils down to "when doing formal verification with some sort of formal logic, what sort of guarantee do I have that the logic is consistent?". And the answer is: none. That's ...
• 150k
Accepted

### Represent there are infinitely many in FOL

The existing answers provide examples of contexts where "there are infinitely many" can be expressed. However, there is an important sense in which "there are infinitely many" cannot be expressed in a ...
• 2,493
Accepted

### Term rewriting; Compute critical pairs

Before adressing the actual questions, one remark on your work so far: the left cancellation in 2.a. is not correct in general, the critical pair would just be $x\circ(e\circ z) \approx x\circ z$. ...
• 2,148

### Expressing 3-SAT in first-order logic

There has been a lot of work on formalizing mathematics, and in all of this work one needs to express definitions, theorems and proofs within the logic that one is using for formalization. This is ...
• 2,446
Accepted

### Using existential quantifier within implication

Your statement attempts to be express in formal logic the following sentence: There exist $\sigma_{opt}$ and $n$ in $R^+$ such that if $0 < n < 1$ then $\sigma_{opt} = n$. The attempt at ...
• 273k

### Why is A implies B true if A is false and B is false?

Let's take an example. Suppose that we want to express that $a$ is the only element of the set $S$ that satisfies property $P$. Then we can write $$\forall x \in S \;\; P(x) \Rightarrow x = a$$ This ...
• 273k

### How would one prove the pigeonhole principle with a SAT solver?

SAT solvers work in the propositional calculus, and usually accept as input a formula in conjunctive normal form. There are several different propositional variants of the pigeonhole principle; they ...
• 273k
Accepted

• 14.3k