I've been practising but I'm not sure of any means to check my work, can anyone point out if they're any mistakes in this proof?
Natural Deduction Proof - Does this work?
173 Views Asked by esperski At
1
There are 1 best solutions below
Related Questions in LOGIC
- core.logic CLP(FD) with ClojureScript
- Developing a Checkers (Draughts) engine, how to begin?
- How to use logical functions with %>% operator (dplyr)
- Unix - Tail Utility would open the file or not
- Combining similar columns in a SQL table?
- Calculating number of nights in overlapping dates
- Logical Operators and Precedence
- Search for zero in 2D array and make a corresponding row and col 0
- How to add repeating occurences of elements in two lists in python
- Error running this fork code in my eclipse, and also have some concept confusion around this code
- PHP logic to add a class to 2 rows every other 2 rows
- PHP: Switch() If{} other control structures
- Logic and Syntax- looking for a shortcut- convert 2D array to a 1D array with no repetitive values
- Given three boxes X, Y, Z. Let W denote white balls and B denote black balls. The contents of the boxes are : X (2W, 3B) , Y(3W, 1B) , Z(1W, 4B).
- Where is the Error in following code snippet, I have made a linkedlist implementation and I am adding elemnts at tail of the LinkedList
Related Questions in FIRST-ORDER-LOGIC
- Z3 ForAll on Arrays
- Records with Z3
- SPASS Theorem Prover - true / false type?
- Haskell - Implementing First Order Logic Expressions
- First Order Logic: Everybody has an initial position
- Convert First Order Logic to Clause Form - Java
- Does the order of prenex quantification matter in EPR fragment?
- When to use conjunction and when to use implication? (First Order Logic)
- How does embedding "there exists" (∃) and "for all" (∀) work?
- Is LOAD a relational algebra operator?
- first order logic creating terms for arithmetic expressions using prolog
- solving quantifier-free VC using z3
- Converting higher order expression into alloy first order logic
- Converting First-order statement into definite clause with AIMA
- Prove that ¬P → ( P → ( P → Q)) is a tautology without using truth tables
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
I have no idea what is “subcomp” in your proof, and how you get 2.
I will not give you the detailed answer, because it looks like homeworks.
The theorem you would like to prove is a conjunction (AND), which means you have to prove both sides: P, and ¬Q.
To prove P, you will have to use reduction to absurdity (from ¬A if you can prove ⊥, then you can prove A), or another of its forms (excluded middle or double negation).
¬Q is easier to prove, just use the ¬ rules.