This question's due date has already passed. You may post a tutorial, but there's no guarantee that the original asker will purchase the tutorial. But other people might!

Question

$30.00 Predicate Truth Tree

  • From Philosophy: Formal-Logic
  • Closed, but you can still post tutorials
  • Due on Aug. 11, 2011
  • Asked on Aug 08, 2011 at 11:45:11PM
Asked by :
albpeter
albpeter Not confirmed
Rating :No Rating
Questions Asked: 8
Tutorials Posted: 0
 
 
Q:

(Example question, attachment is full questions)

Biconditional:  ≡                                 […IFF…]

Conditional:  >                                   [IF…THEN…]

Conjunction:  &                                 [BOTH…AND…]

Disjunction:  v                                                [EITHER…OR…]

Negation:  ~                                       [NOT…]

Existential Quantifier:  Ǝ                    [SOME…]

Universal Quantifier:  ᵾ                    [ANY…]

Sequent: ├                                          [THUS…]



Perform a predicate truth tree analysis on the following propositions, pairs of propositions, and sequents.  Show the sufficiently decompose truth tree and your analysis of the logical property in question. 

 

1:  Test for Contingency, Inconsistency, Tautology

 

            (Ǝx)(ᵾy)(Dyx > ~Dxy)

            (SOME x)(ANY y)(IF y D x THEN x NOT D y)

 

 
attachement
Attachments:
logictree.docx (27K)
 

Available Tutorials to this Question
 
$40.00
Part B only. Correct Solution
  • This tutorial was purchased 1 time and rated No Rating by students like you.
  • Posted on Aug. 09, 2011 at 12:08:32AM
Posted by :
reviewermath
reviewermath
Rating (519):A+
Questions Asked: 0
Tutorials Posted: 1616,
Blog Posts: 2,
Earned: $13,876.23
 
A:
Preview: ... need clari ...
The full tutorial is about 9 words long plus attachments.

attachmentlogo

Attachments:
correct solution to Part B Phil.docx (25K) (Preview)