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.

Filter by
Sorted by
Tagged with
1
vote
0answers
52 views

What is (∃!e) in Davidson 1967?

Davidson proposes a causal law for singular event causation. Here is one example of a backward-looking part of such a law (changed slightly for clarity and to avoid copyright infringement): (e)(u)((...
-3
votes
0answers
46 views

How to prove ⊢ ¬ D & ¬ F [closed]

1. (A v ¬ B) ↔ ¬ (A F) P 2. (C ↔ ¬ B) P 3. ¬ (¬ C v D) P ⊢ ¬ D & ¬ F
0
votes
0answers
54 views

Alphabetic Substitution, Barcan, and Strict Implication

Context: I'm stuck on Axiom 8 from the introduction to Barcan 1946, "A Functional Calculus of First Order Based on Strict Implication." My instinct is that I'm missing a basic, perhaps obvious concept-...
-4
votes
2answers
215 views

Is Classical Logic the proper model of the deductive logic of human reasoning?

Which mathematicians and philosophers unambiguously claimed that Classical Logic was the proper model of the deductive logic of human reasoning, and when did they say it? The expression "Classical ...
4
votes
2answers
163 views

What does the colon (:) mean in conjunction with material implication?

Errol E. Harris does an excellent job of explaining dialectical logic in Formal, Transcendental, and Dialectical Thinking, but in the section on formal logic, he assumes a familiarity with symbolic ...
0
votes
2answers
60 views

How to prove (A v ¬ B), (¬ A v C), (¬ C → B) therefore (¬ D v C)

My idea is to use disjunction elimination on (¬ A v C)to obtain C, and then use disjunction introduction to obtain (¬ D v C), but I'm having a hard time obtaining C.
0
votes
1answer
47 views

Complete a formal proof of ~(~A&~B) from A in as few lines as possible

Prove ~(~A&~B) from A in as few lines as possible. ~ = negation & = conjunction v = disjunction | = line in a subproof Here's what I have: A - Premise |~A - Assume |~B ...
0
votes
1answer
47 views

How do I prove :((A ⊃ B) ⊃ C) ⊃ (B ⊃ C)?

How do I prove, :((A ⊃ B) ⊃ C) ⊃ (B ⊃ C), using symbolic logic derivations where ⊃ represents a conditional i.e. A ⊃ B = A implies B? The first line of my derivations is the assumption, (A ⊃ B) ⊃ C)....
1
vote
1answer
28 views

In Quine's ontology, why does a 'recognition' of something lead to ontological commitment while a 'feeling' does not?

We are discussing Quine's On What There Is in a metaphysics class I am in. I felt like I understood what he meant, that if something has to be predicated for in a sentence, we are ontologically ...
7
votes
2answers
172 views

How do proofs about logic fit into a logical framework?

I'm learning logic from Michael O'Leary's A First Course in Mathematical Logic and Set Theory. In chapter 1 he carefully explains the meaning of logical implication (p ⊨ q), logical inference (p ⟹ q), ...
0
votes
0answers
57 views

Is there a semantically complete system of direct-method deductive logic?

Does anybody know of a system of direct-method deductive (propositional) logic, in other words, a system that does not require (or even incorporate) conditional (and indirect) proof method(s) and that ...
5
votes
1answer
102 views

Can/Do there exist any quantifiers other than “there exists” and “for all”?

I'm curious about why there are only the two logical quantifiers there exists and for all. Intuition and human language support the idea that these quantifiers make sense, but otherwise it seems ...
0
votes
2answers
73 views

How can one prove ∃𝑥(𝐹(𝑥)→𝐺(𝑥)) given the premise ∃𝑥𝐹(𝑥)→∃𝑥𝐺(𝑥)? [closed]

Premise: ∃𝑥𝐹(𝑥)→∃𝑥𝐺(𝑥) Desired Conclusion: ∃𝑥(𝐹(𝑥)→𝐺(𝑥))
0
votes
1answer
60 views

Question about v-variants of variable assignments

In Full Predicate Calculus, some variable assignment q satisfies a disjunction under interpretation U if q satisfies one or both disjuncts under U, it satisfies a conjunction under interpretation U if ...
1
vote
2answers
58 views

Truth Value of Definite Descriptions

I'm currently studying definite descriptions in logic. My textbook postulates Bertrand Russell's view of definite descriptions, but I'm curious about other views as well (in the context of classical 2-...
0
votes
2answers
78 views

Fitch Proof Exercise 6.20

I am working on a proof and am stuck on a step. I am not sure why I cannot assume the negation of B. Is it not allowed or am I missing something? Thank you]1
-1
votes
2answers
72 views

How can I prove the law of excluded third (p ∨ ¬p)) using Fitch?

Good day. I do not quite understand how I can get ~~p after the 11th line. According to the proof of the law itself (and all reasonable logic) I should get it, and then simplify the expression - but ...
0
votes
1answer
64 views

Proof by natural deduction advice

Any advice on shortening my right to left proof will be appreciated.
0
votes
2answers
83 views

Help with natural deduction by introduction and elimnation rules

This is where I’ve gotten so far. I’ve proven it from left to right but I’m getting some trouble proving it from right to left. I’m trying to reach the conclusion by double negation.
-1
votes
1answer
71 views

How to derive P > (Q > R) from (P > Q) > R in Fitch?

I am having a little bit of difficulty coming up with a Fitch-style natural deduction proof. Presumably, I need to use a few conditional introduction rules, but I am not sure what I can get out of ...
0
votes
2answers
209 views

Fitch Proof - Logic LPL 6.31

I am trying to complete the following proof in Fitch but am completely clueless on how to approach it. Any help would be appreciated! Thanks
2
votes
1answer
46 views

Why doesn't one assert in metamathematics that a sentence S is a logical consequence of the conjunction of a set of sentences?

In other words, why isn't there -- at least in standard textbook presentations of things like the deduction theorem and the compactness theorem -- a conjunction connective that is applied to sets of ...
0
votes
2answers
72 views

Logic Question in a fitch style system - disjunction elimination

I am having difficulty in formally proving two arguments. Firstly, given the premises A ∨ (B∧C) ¬B∨¬C∨ D derive A v D. I can see why it has to be either A or D, because if it's B and C, ...
0
votes
1answer
52 views

What is the difference between a function and a relation in first-order logic?

Consider this definition of first-order (or Herbrand) logic syntax. Here is the vocabulary: Definition (Vocabulary): A vocabulary V consists of: A set of relation constants {r1, ...,...
3
votes
1answer
150 views

What's the difference between a second-order relation and a relation between objects?

I was reading an article in philosophy and found this: Some philosophers have denied that there is such a relation as identity. Thus Ludwig Wittgenstein writes (Tractatus 5.5301): "That ...
0
votes
2answers
80 views

How should one symbolize “and then” in logic?

Graham Priest observed that not all uses of "and" in English commute: (page 15) ...according to the truth table for &, 'a and b' always has the same value as 'b and a', namely, they are both ...
12
votes
9answers
3k views

How to prove (A v B), (A → C), (B → D) therefore (C v D)

Obviously since A → C and B → D then if A v B one of C or D must be true. My only idea is v must be introduced, but how would I use subproofs to show one of A /\ C or B /\ D is never false if A v B?
3
votes
1answer
41 views

Logic terminology: does “conditional” etc refer to the operator or the WFF?

To be precise.... Do the terms we use to talk about the truth-functional operators (conditional, negation, conjunction, disjunction, biconditional) refer to the operator in isolation, or the WFF that ...
-1
votes
2answers
354 views

What is model theory?

I have never been able to understand any need or even any benefit of model theory. Both Rudolf Caranp and Richard Montague showed how to encode semantics directly in the syntax. Can you help me ...
2
votes
1answer
48 views

What are the legal quantifier negation rules?

Is using Quantifier Negation to flip two quantifiers at once legal in symbolic logic? Example: ~∀x∀y(Hhx & Hhy) ƎxƎy~(Hhx & Hhy) 1 QN Or do I need to do this in 2 steps? Example: ~∀x∀...
3
votes
2answers
88 views

Are verb tenses actually irrelevant in logic?

In my Introduction to Logic course, we learned that verb tenses are irrelevant when symbolizing and deducing arguments. However, it seems to me that the verb tenses could sometimes choose whether or ...
4
votes
1answer
112 views

What is the logical law proving “if not p then q” is equivalent to “p or q”?

I know that (¬p → q) ≡ (p v q) from comparing the truth tables. But is there a law that states this? Something like the laws of propositional logic: idempotent, associative, commutative, distributive, ...
2
votes
3answers
97 views

A deontic premise that leads to a necessity from a permission

I wanted to devise some rules for myself, then formulate those rules using formal symbolic logic, and one of the rules that I have set for myself is : "Do not say what is unnecessary", in other words :...
2
votes
2answers
161 views

Does the existential quantifier express existence?

Does the existential quantifier express existence? The existential quantifier is a symbol of symbolic logic which expresses that the statements within its scope are true for at least one ...
0
votes
2answers
75 views

How does one tell if logical expressions are equivalent?

How do I check if these expressions are equivalent? ∀a,b [P(a) ∧ ¬R(a) ∧ S(b)] → G(a,b) ∀a [(P(a) ∧ ¬R(a)) → (∀b [S(b) → G(a,b)])]
5
votes
2answers
131 views

Is it possible to construct infinitely many non-equivalent formulas in predicate logic?

In the language of predicate logic with only identity and no predicates, function symbols, or constants, is it possible to construct infinitely many non-equivalent formulas?
0
votes
2answers
92 views

How to solve this natural deduction problem?

This one is driving me crazy. I don't understand most keys for de morgan, modus ponens, etc, so please abbreviate if possible? EX: DM, MP, SIMP, HS, Conj, Imp (material Implication). Thank you anybody ...
-1
votes
2answers
181 views

Honestly have no Idea how to prove A v ¬¬B from A v B (LPL Q. 6.18)

Premise A v B Goal A v ¬¬B Please help. It seems so self evident but I don't know how to get there.
0
votes
1answer
88 views

How to define a new logical language

There are a number of logical languages defined that are so called flavors of a certain logic (for example, flavors of First Order Logic). Such new logical languages sometimes extend or restrict the ...
3
votes
4answers
937 views

What is the difference between logical consistency and logical entailment in deductive logic?

I am having a little trouble sorting out two definitions from the first chapter in my logic textbook, The Logic Book by Bergmann, Moor and Nelson. I am under the impression that a set in a sentence ...
1
vote
1answer
64 views

How to translate “No dolphin sings unless it jumps” into predicate logic?

i have a silly logic question again. How would you translate the following sentence into predicate logic? No dolphin sings unless it jumps. My guess is that it is an E-sentence of the form "no A ...
2
votes
1answer
79 views

How to translate “Only dogs and dolphins jump if petted” into predicate logic?

The Logic2010 software provides exercises for the symbolization of English sentences. But i'm stuck with one symbolization, which closely resembles another one I solved correctly. The first one ...
1
vote
1answer
75 views

What is the meaning of free variables?

In some books I see something like: phi(x1,...,xn) with free variables among x1,...,xn. An example of this is on 2nd paragraph, page 25 of the book Knowledge in Action. I have included a snapshot of ...
1
vote
1answer
65 views

Logical, semantic and self-referential paradoxes: The Truth teller and the Liar (draft) can an expert on the matter give feedback?

Title: Logical semantic and self-referential paradoxes: The Truthteller and the Liar (draft, informal) (major) assumption: A statement is either true or not true (law of excluded middle, classical ...
1
vote
1answer
126 views

Fitch Proof - Arrow's logic of preferences

I've been stumped on this one question in particular for several days now and I'm hoping to get some help on where I'm going wrong. Given the following premises: ∀x∀y(StrongPref(x,y)→ ¬StrongPref(y,...
6
votes
1answer
280 views

What exactly is a first-order logic?

Can someone explain in simple terms what exactly is a first-order logic? From my amateur standpoint, I think that first-order logic is a some kind of a system of symbols and general logical rules and ...
1
vote
1answer
67 views

Do computer languages instantiate only predicate calculus?

All the computer languages I'm familiar with, be they imperative or declarative have the same core mechanics (arithmetic and logic).They have the same loops, conditionals etc. Whatever the language it ...
-1
votes
3answers
66 views

A question about possibility

If A, then B ~ A So, possible that B Valid or not? My take: Not valid. Reason: Valid means if all the premises are true, the conclusion must be true That means adding new information should not ...
2
votes
1answer
121 views

Proof Tree to Fitch Proof

I was wondering if anyone could help me on a proof I've been working on: I was able to check that it is valid with a proof tree generator (prooftools): However, I still haven't figured out the proof....
0
votes
2answers
68 views

Fitch Question Please Help Me [closed]

I'm having trouble understanding writing out a proof. The proof I'm trying to work with is : [![enter image description here][1]][1] How do I reach this goal? Which rules do I use and with which ...