Logic Proof Calculator. You can sign in to vote the answer. You may add additional sentences to your set by repeating this step. 0 0. soccermikey5. Learn more Accept. I found the link on your profile and downloaded it. The facts and the question are written in predicate logic, with the question posed as a negation, from which gkc derives contradiction. Write a symbolic sentence in the text field below. To download DC Proof and for a contact link, visit my homepage. By using this website, you agree to our Cookie Policy. – Dan Christensen Oct 24 '18 at 20:18. 0 0. Example 1 for basics. When your sentence is ready, click the "Add sentence" button to add this sentence to your set. If you enter a modal formula, you will see a choice of how the accessibility relation should be constrained. Send me a full list of your axioms and I will see what I can do to get you started. 4 years ago. For modal predicate logic, constant domains and rigid terms are assumed. 1 decade ago . Sign in. How do you think about the answers? Sentential Logic; Predicate Logic; Syntax. This is a really trivial example. This website uses cookies to ensure you get the best experience. DC Proof 2.0 is based on classical logic, but it is possible to define your axioms in it. Source(s): https://shrinks.im/a9GEm. Besides classical propositional logic and first-order predicate logic (with functions, but without identity), a few normal modal logics are supported. Logic Proof Solver. This truth-table calculator for classical logic shows, well, truth-tables for propositions of classical logic. Q=P=6. Free Pre-Algebra, Algebra, Trigonometry, Calculus, Geometry, Statistics and Chemistry calculators step-by-step. Source(s): https://shrink.im/a9B2A. 1 decade ago. Truth Tree Solver. You may add any letters with your keyboard and add special characters using the appropriate buttons. Featuring a purple munster and a duck, and optionally showing intermediate results, it is one of the better instances of its kind. Use the buttons below (or your keyboard) to enter a proposition, then gently touch the duck to have it calculate the truth-table for you. Ian. 0 3. laverriere. a web application that decides statements in symbolic logic including modal logic, propositional logic and unary predicate logic Lv 4. We will give two facts: john is a father of pete and pete is a father of mark.We will ask whether from these two facts we can derive that john is a father of pete: obviously we can..