Questions tagged [symbolic-logic]
For questions related to symbolic logic, also known as mathematical logic. Topics might range from philosophical implications of metamathematical results to technical questions.
352 questions
-3
votes
1
answer
70
views
Is addition a ternary predicate or a predicate with an arity greater than three? [closed]
Is addition a ternary predicate or a predicate with an arity greater than three?
I ask because of the following: Addition is a mathematical operation.
A mathematical operation is a function.
A ...
6
votes
11
answers
2k
views
Does math admit (care about) the existence of an entity?
Philosophers always concern about the existence of entities. For example, they discuss the propositions like "The bird exists." or "Unicorn does not exist". But in math, ...
3
votes
1
answer
598
views
How would you formalise the sentence "I am a liar" in first order logic?
How would you formalise the sentence "I am a liar" in first order logic?
ChatGPT can't do that, what seems to be the problem?
0
votes
2
answers
176
views
Does a vacuous quantifier have to be interpreted vacuously?
Does a vacuous quantifier have to be interpreted vacuously? I would say no because of the following:
Let multiplication be interpreted as conjunction
Let addition be interpreted as disjunction
Let N ...
4
votes
3
answers
498
views
Relation between the truth of P→Q when P is false and the principle of explosion
According to the truth table, P→Q is true when P is false.
On the other hand, the principle of explosion (ex falso quodlibet) states that from a contradiction, such as P∧¬P , any statement Q can ...
-5
votes
1
answer
133
views
Can existence be treated of as an n-ary predicate? [closed]
Can existence be treated of as an n-ary predicate?
I ask because it seems it can be treated as an n-ary predicate due to the following examples:
A. Infinity exists in divisibility as a mode.
A1. ∀X1∀...
1
vote
2
answers
231
views
Can the definitions of quantifiers be formalized inside first-order logic?
Can the definitions of the universal and existential quantifiers be formalized inside of first-order logic?
Consider the following:
There exist X1 and X2, such that X1 is a quantifier, and X2 is a ...
3
votes
2
answers
178
views
Has a closed set of rules of inference, sans conditional/indirect proof, for a textbook system of natural deduction ever been crafted/discovered?
By "textbook system", I mean like the commonplace 18-or-so-rule kind of systems of natural deduction that prevalently appear in logic textbooks, such as those of, say, Patrick Hurley or Stan ...
3
votes
4
answers
387
views
Truth Tables vs Metalanguage
I've seen in the book "Logic for everyone" by Jason Decker that he writes the Propositions on the header of the tables as meta-Propositions.
E.g. for the formula
A→C
𝒜
𝒞
𝒜→𝒞
T
T
T
T
F
F
...
7
votes
3
answers
750
views
Do variables belong to metalanguage
I'm learning the nuance between using and mentioning. Maybe what I'm going to write is a result of misunderstanding.
The object language (OL) contains names of objects from a domain, a assumed real ...
-1
votes
1
answer
142
views
Is there a theory which is the true theory of logical reasoning?
Is there any theory of which any logician would be prepared to say that it is the true theory of logical reasoning?
If there is one, which is it, and who says that it is the true theory of logical ...
0
votes
0
answers
105
views
How to prove ¬(A ∧ B) → (¬(C → D) ∧ ¬C) ⊢ A? Fitch-style for TFL proof
I'm really confused how to solve this and how to correct it? If anyone could help I would greatly appreciate it!
1
vote
1
answer
161
views
How to prove this argument? I'm thinking it's an invalid argument, but it was presented on an exam as valid & provable
The argument is as follows:
~D ∨ F
F ⊃ ~D /~D
with lines 1 and 2 being premises, and ~D being the conclusion. Apologies if that is not the most standard notation; that's how it was ...
4
votes
1
answer
192
views
Chemistry & Peirce’s Existential Graphs
Do Peirce’s Existential Graphs remind one of the orbital and molecular diagrams used in General Chemistry & Organic Chemistry?
For reference, check the following links:
https://plato.stanford.edu/...
4
votes
3
answers
1k
views
Why are we allowed to use inference rules instead of truth tables in order to prove an argument's validity?
According to Copi's Symbolic Logic
A more convenient method of establishing the validity of some
arguments is to deduce their conclusions from their premisses by a
sequence of shorter, more ...