Overview

Purpose

This is currently an experimental site, which I am constructing while trying to develop some (relatively!) simple C++ software for manipulating classical propositional logic expressions. I will be adding rough content and reworking it as I go along. Progress will be slow as this is just a part-time hobby for me. I will try to add new content at least once a week. My long-term aim is to publish my C++ source code and provide a baseline specification, interface and test environment for whoever may want to have a go at a more complex solution.

Silvestro Fantacci

Content

Classical Propositional Logic

Classical propositional logic is a truth-functional and two-valued propositional logic. Propositional logic deals with how propositions (or statements) are constructed/connected with each other.

Basic Expression Types

There are a total of twelve types of classical propositional logic expressions containing no more than two logical variables.

Expression Representation

A classical propositional logic expression (formula) can be decomposed into a set of elements, a truth function and a one-to-one correspondence between elements and function inputs.

Truth Function Representation

A truth function can be represented as a truth table. A truth table can be represented as a sequence of truth values.

Software Requirements

A detailed specification of what the software shall provide, as seen from the perspective of a user looking at the application programming interface.

C++ Source Code

A snippet from a class header gives a first taste of how the software interface may look like.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License