Storing and simplifying propositions in predicate calculus. This is version 1.
-
-
What This Module Does - An overview of the calculus module's role and abilities. -
How To Include This Module - What to do to make use of the calculus module in a new command-line tool. -
Introduction to Predicate Calculus - An exposition of the form of predicate calculus used by Inform.
-
-
-
Calculus Module - Setting up the use of this module.
-
-
-
Compilation Schemas - To create, and later expand upon, short prototypes of I6 syntax for such run-time tasks as the setting, unsetting or testing of a relation. -
Unary Predicates - A lightweight structure to record uses of an adjective, either positively or negatively. -
Binary Predicate Families - To create sets of relations for different purposes. -
Binary Predicates - To create and manage binary predicates, which are the underlying data structures beneath Inform's relations. -
The Equality Relation - To define that prince among predicates, the equality relation.
-
-
-
Terms - Terms are the representations of values in predicate calculus: variables, constants or functions of other terms. -
Atomic Propositions - To build and modify atoms, the syntactic pieces from which propositions are built up. -
Propositions - To build and modify structures representing propositions in predicate calculus. -
Binding and Substitution - To substitute constants into propositions in place of variables, and to apply quantifiers to bind any unbound variables.
-
Powered by Inweb.