Skip to main content

Navigation Icons in the header

Home Contact Sitemap Search
SoftOption ®

Breadcrumb

  1. Home
  2. Tree Tutorials [Propositional, Predicate, Identity, and Modal Logic Trees—Default Syntax]

Tree Tutorial 3: Using Trees to Test for Satisfiability and Invalidity

Topic
trees
Logical System
default
  • Reading a Counter Example from the Tree

Book traversal links for Tree Tutorial 3: Using Trees to Test for Satisfiability and Invalidity

  • ‹ Propositional Exercises: Roll your own
  • Up
  • Reading a Counter Example from the Tree ›
  • Preliminary [Pre-test]
  • Tree Tutorial 1: Propositional Trees: Introduction
  • Tree Tutorial 2: More Propositional Tree Rules
  • Review of Tree Propositional Rules
  • Tree Tutorial 3: Using Trees to Test for Satisfiability and Invalidity
    • Reading a Counter Example from the Tree
  • Notation for Predicates
  • Tree Tutorial 4: Predicate Logic Trees
  • Review of Tree Predicate Rules
  • Tree Tutorial 5: Identity Rules
  • Tree Tutorial 6: Functional Terms and First Order Theories
  • Tree Tutorial 7: Type Labels, Sorts, and Signatures ['Mixed Domains']
  • Tree Tutorial 8 Modal Trees

Navigation

Show — Navigation Hide — Navigation
  • Browse
  • Search
  • Site map
Copyright SoftOption ® Ltd. (New Zealand). Email: support@SoftOption.Us